HDTenEightyP/NetNews huggingface dataset:
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Subject: Scheme release scm4a0 (alpha) available.
Organization: M.I.T. Artificial Intelligence Lab.
Date: Mon, 13 Apr 1992 07:21:19 GMT

This message announces the availability of Scheme release scm4a0.

DELAY, FORCE, TRANSCRIPT-ON and TRANSCRIPT-OFF have been added.  The
read macro syntax #. has been added.  The file functions have been
rewritten in terms of OPEN-FILE and OPEN-PIPE.  FILE-EXISTS?,
STRING-SET-LENGTH!, and STRING-VECTOR-LENGTH! have been added.  ALARM
and support for SIGALRM interrupts have been added.  Process
synchronization primitives have been added.  Machines with 64 bit
words are now supported.  HEDDEN@esdsdf.dnet.ge.com (Jerry D.  Hedden)
has fixed problems with numeric comparisons.

Scm conforms to Revised^4 Report on the Algorithmic Language Scheme
and the IEEE P1178 specification.  Scm is written in C and runs under
Amiga, Atari-ST, MacOS, MS-DOS, NOS/VE, VMS, Unix and similar systems.
ASCII and EBCDIC are supported.

Documentation is included explaining the many Scheme Language
extensions in scm, the internal representation and how to extend or
include scm in other programs.

SCM can be obtained via FTP (detailed instructions follow) from:
altdorf.ai.mit.edu:archive/scm/scm4a0.shar
altdorf.ai.mit.edu:archive/scm/slib1b5.shar
altdorf.ai.mit.edu:archive/scm/scm4a0.tar.Z
altdorf.ai.mit.edu:archive/scm/slib1b5.tar.Z
nexus.yorku.ca:pub/oz/scheme/new/scm4a0.shar
nexus.yorku.ca:pub/oz/scheme/new/slib1b5.shar
nexus.yorku.ca:pub/oz/scheme/new/scm4a0.tar.Z
nexus.yorku.ca:pub/oz/scheme/new/slib1b5.tar.Z

  ftp altdorf.ai.mit.edu [18.43.0.246] (anonymous)
  cd archive/scm
or
  ftp nexus.yorku.ca (anonymous)
  cd pub/oz/scheme/new

This directory contains the distribution version 3c of scm.
  `scm4a0.shar' is a shar file of the C code distribution.
  `scm4a0.tar.Z' is a compressed tar file of the C code distribution.
  `slib1b5.shar' is a shar file of a Scheme Library.
  `slib1b5.tar.Z' is a compressed tar file of a Scheme Library.

Remember to use binary mode when transferring the *.tar.Z files.
Be sure to get and read the GNU General Public License (COPYING).
It is included in the scm4a0.shar and scm4a0.tar.Z files.

To receive an IBM PC floppy disk with the source files and MSDOS
executable send $60 ($65 for i386 version) to
Aubrey Jaffer, 84 Pleasant St. Wakefield MA 01880, USA.

If you like scm you can support the developement and maintainence of
it by buying a disk from me or by sending money to the above address.
Money received will also help speed the release of a free symbolic
mathematics system (written in scheme).
Newsgroups: comp.lang.scheme
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Subject: Re: Anyone got checkers in scheme?
Organization: M.I.T. Artificial Intelligence Lab.
Date: Sat, 11 Apr 1992 05:41:51 GMT

This is the second recent posting from a university asking for `AI'
Scheme programs.  Are these students asking us to do their midterm
projects?  I inquired of the last one what he wanted the programs for
but received no answer.  Homework problems are often posted to
sci.math.
Newsgroups: comp.lang.scheme
From: gls@think.COM (Guy Steele)
Subject: Scheme Digest V4 #93
Organization: The Internet
Date: Tue, 7 Apr 1992 16:11:41 GMT

   Date: 7 Apr 92 02:03:24 GMT
   From: Simon Alexander GREGORY <simong@mundil.cs.mu.oz.au>

   Can anybody write me a procedure to construct this?

   Given this list '( 1 0 0 1 0 0 0 1 0 0 0 0 1 1)

   Result wanted is: ( 1 ( 0 0 ) 1 ( 0 0 0 ) 1 ( 0 0 0 0 ) 1 1)

   Note: the 1's should be able to be any type that will mean create
   a sublist.

If a 1 meant "create a sublist", then I would expect the result
to be ( 1 ( 0 0 ) 1 ( 0 0 0 ) 1 ( 0 0 0 0 ) 1 () 1 ()).  Given
your example, perhaps better to describe it as "replace each
maximal subsequence of non-1's with a list of them".

   ie. vowels lets say.

   given ( a n m n b e f j k l a e) 

   result

   ( a (n m n b) e (f j k l) a e)

Okay, let's try:

(define mangle (lambda (x f) (munge x f '())))

(define munge (lambda (x f s)
		(if (null? x)
		    (if (null? s) '() (list (reverse s)))
		    (if (f (car x))
                        (if (null? s)
			    (cons (car x) (munge (cdr x) f '()))
			    (cons (reverse s)
				  (cons (car x) (munge (cdr x) f '()))))
		        (munge (cdr x) f (cons (car x) s))))))

(mangle '(a n m n b e f j k l a e) vowel?)
=> (A (N M N B) E (F J K L) A E)

--Guy Steele
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Newsgroups: comp.lang.scheme
Subject: Scheme Library slib1b5 available.
Date: 8 Apr 92 20:18:04 GMT
Organization: M.I.T. Artificial Intelligence Lab.

This message announces the availability of Scheme Library release
slib1b5.

New in release slib1b5 are:
queue.scm (from Andrew Wilcox (awilcox@astro.psu.edu)).
Require now uses macro:load if 'macro is part of catalog entry.

SLIB is a portable scheme library meant to provide compatibiliy and
utility functions for all standard scheme implementations.

SLIB includes initialization files for GAMBIT, MITScheme, scheme->C,
and T3.1.  Scm3c also supports SLIB.

Documentation includes a manifest, installation instructions, and
proposed coding standards for the library.  Documentation on each
library package is supplied.

SLIB can be obtained via ftp (detailed instructions follow) from:
altdorf.ai.mit.edu:archive/scm/slib1b5.shar
altdorf.ai.mit.edu:archive/scm/slib1b5.tar.Z
nexus.yorku.ca:pub/oz/scheme/new/slib1b5.shar
nexus.yorku.ca:pub/oz/scheme/new/slib1b5.tar.Z

  ftp altdorf.ai.mit.edu [18.43.0.246] (anonymous)
  cd archive/scm
or
  ftp nexus.yorku.ca (anonymous)
  cd pub/oz/scheme/new

  `slib1b5.shar' is a shar file of a Scheme Library.
  `slib1b5.tar.Z' is a compressed tar file of a Scheme Library.

Remember to use binary mode when transferring the *.tar.Z files.
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Newsgroups: comp.lang.scheme
Subject: Re: Yet news about PC-Scheme
Date: 8 Apr 92 18:30:34 GMT
Organization: M.I.T. Artificial Intelligence Lab.

In article <1992Apr7.203854.1347@uni2a.unige.ch> vuilleum@uni2a.unige.ch writes:

      Since 1988, Texas hasn't provided any major enhencement to PC-Scheme.
   Source code is available, but so dirty and buggy that nobody could maintain
   it, not to say making any innovative use of it.
      Anyway, there are still quite a lot of people who are interested in
   developping under a small yet powerfull Scheme interpreter, running on PC
   computers. Some users recently wanted Mouse support, other R^4, and so on.

Those people have to wait no longer!  scm3c13 is R^4 and IEEE
compliant an compiles under Microsoft C, Turbo C, Borland C, and Gnu C
under MSDOS.  Here is an announcement for the latest version.  There
is also a Graphics package in TURTLSCM.LZH in the same directories.
----------------------------------------------------------------------
This message announces the availability of Scheme release scm3c13.

Scm conforms to Revised^4 Report on the Algorithmic Language Scheme
and the IEEE P1178 specification.  Scm is written in C and runs under
Amiga, Atari-ST, MacOS, MS-DOS, NOS/VE, VMS, Unix and similar systems.
ASCII and EBCDIC are supported.

Documentation is included explaining the many Scheme Language
extensions in scm, the internal representation and how to extend or
include scm in other programs.

SCM can be obtained via FTP (detailed instructions follow) from:
altdorf.ai.mit.edu:archive/scm/scm3c13.shar
altdorf.ai.mit.edu:archive/scm/slib1b4.shar
altdorf.ai.mit.edu:archive/scm/scm3c13.tar.Z
altdorf.ai.mit.edu:archive/scm/slib1b4.tar.Z
nexus.yorku.ca:pub/oz/scheme/new/scm3c13.shar
nexus.yorku.ca:pub/oz/scheme/new/slib1b4.shar
nexus.yorku.ca:pub/oz/scheme/new/scm3c13.tar.Z
nexus.yorku.ca:pub/oz/scheme/new/slib1b4.tar.Z

  ftp altdorf.ai.mit.edu [18.43.0.246] (anonymous)
  cd archive/scm
or
  ftp nexus.yorku.ca (anonymous)
  cd pub/oz/scheme/new

This directory contains the distribution version 3c of scm.
  `scm3c13.shar' is a shar file of the C code distribution.
  `scm3c13.tar.Z' is a compressed tar file of the C code distribution.
  `slib1b4.shar' is a shar file of a Scheme Library.
  `slib1b4.tar.Z' is a compressed tar file of a Scheme Library.

Remember to use binary mode when transferring the *.tar.Z files.
Be sure to get and read the GNU General Public License (COPYING).
It is included in the scm3c13.shar and scm3c13.tar.Z files.

To receive an IBM PC floppy disk with the source files and MSDOS
executable send $60 ($65 for i386 version) to
Aubrey Jaffer, 84 Pleasant St. Wakefield MA 01880, USA.

If you like scm you can support the developement and maintainence of
it by buying a disk from me or by sending money to the above address.
Money received will also help speed the release of a free symbolic
mathematics system (written in scheme).
Newsgroups: comp.lang.scheme
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Subject: Scheme release scm4a1 (alpha) available.
Organization: M.I.T. Artificial Intelligence Lab.
Date: Wed, 15 Apr 1992 18:30:06 GMT

scm4a0 had some missing declarations.  scm4a1 should be better
behaved.  There is a patch file scm4a1.pat.  The regular announcement
follows:
----------------------------------------------------------------------
This message announces the availability of Scheme release scm4a1.

DELAY, FORCE, TRANSCRIPT-ON and TRANSCRIPT-OFF have been added.  The
read macro syntax #. has been added.  The file functions have been
rewritten in terms of OPEN-FILE and OPEN-PIPE.  FILE-EXISTS?,
STRING-SET-LENGTH! STRING-VECTOR-LENGTH! have been added.  ALARM and
support for SIGALRM interrupts have been added.  Process
synchronization primitives have been added.  Machines with 64 bit
words are now supported.  HEDDEN@esdsdf.dnet.ge.com (Jerry D.  Hedden)
has fixed problems with numeric comparisons.

Scm conforms to Revised^4 Report on the Algorithmic Language Scheme
and the IEEE P1178 specification.  Scm is written in C and runs under
Amiga, Atari-ST, MacOS, MS-DOS, NOS/VE, VMS, Unix and similar systems.
ASCII and EBCDIC are supported.

Documentation is included explaining the many Scheme Language
extensions in scm, the internal representation and how to extend or
include scm in other programs.

SCM can be obtained via FTP (detailed instructions follow) from:
altdorf.ai.mit.edu:archive/scm/scm4a1.shar
altdorf.ai.mit.edu:archive/scm/slib1b5.shar
altdorf.ai.mit.edu:archive/scm/scm4a1.tar.Z
altdorf.ai.mit.edu:archive/scm/slib1b5.tar.Z
nexus.yorku.ca:pub/oz/scheme/new/scm4a1.shar
nexus.yorku.ca:pub/oz/scheme/new/slib1b5.shar
nexus.yorku.ca:pub/oz/scheme/new/scm4a1.tar.Z
nexus.yorku.ca:pub/oz/scheme/new/slib1b5.tar.Z

  ftp altdorf.ai.mit.edu [18.43.0.246] (anonymous)
  cd archive/scm
or
  ftp nexus.yorku.ca (anonymous)
  cd pub/oz/scheme/new

This directory contains the distribution version 3c of scm.
  `scm4a1.shar' is a shar file of the C code distribution.
  `scm4a1.tar.Z' is a compressed tar file of the C code distribution.
  `slib1b5.shar' is a shar file of a Scheme Library.
  `slib1b5.tar.Z' is a compressed tar file of a Scheme Library.

Remember to use binary mode when transferring the *.tar.Z files.
Be sure to get and read the GNU General Public License (COPYING).
It is included in the scm4a1.shar and scm4a1.tar.Z files.

To receive an IBM PC floppy disk with the source files and MSDOS
executable send $60 ($65 for i386 version) to
Aubrey Jaffer, 84 Pleasant St. Wakefield MA 01880, USA.

If you like scm you can support the developement and maintainence of
it by buying a disk from me or by sending money to the above address.
Money received will also help speed the release of a free symbolic
mathematics system (written in scheme).
Newsgroups: comp.lang.scheme
From: spot@CS.CMU.EDU (Scott Draves)
Subject: Re: deriving quines
Date: Wed, 08 Apr 92 05:13:30 GMT
Organization: School of Computer Science, Carnegie Mellon University
Originator: spot@HOPELESS.MESS.CS.CMU.EDU

>>>>> On 7 Apr 92 01:36:39 GMT, hopkins@coulin.turing.ac.uk (Don Hopkins) said:

Don> The classic Lisp (or Scheme) quine is:

Don> (lambda (x)
Don>   (list x (list (quote quote) x))
Don>   (quote
Don>     (lambda (x)
Don>       (list x (list (quote quote) x)))))


  ((lambda (lambda) `(,lambda ',lambda)) 
   '(lambda (lambda) `(,lambda ',lambda)))


originally from mark kantrowitz and olin shivers
-- 
			conform
scott draves		deform
spot@cs.cmu.edu		explode
Newsgroups: comp.lang.scheme
From: simong@mundil.cs.mu.OZ.AU (Simon Alexander GREGORY)
Subject: Help with problem
Summary: Need help with problem
Organization: Computer Science, University of Melbourne, Australia
Date: Tue, 7 Apr 1992 02:03:24 GMT

Can anybody write me a procedure to construct this?

Given this list '( 1 0 0 1 0 0 0 1 0 0 0 0 1 1)

Result wanted is: ( 1 ( 0 0 ) 1 ( 0 0 0 ) 1 ( 0 0 0 0 ) 1 1)

Note: the 1's should be able to be any type that will mean create
a sublist.

ie. vowels lets say.

given ( a n m n b e f j k l a e) 

result

( a (n m n b) e (f j k l) a e)
From: kend@data.rain.com (Ken Dickey)
Newsgroups: comp.lang.scheme
Subject: Re: Help with problem
Date: 7 Apr 92 19:55:32 GMT
Article-I.D.: data.644
Organization: Microtek DSD, Hillsboro, OR



I was not going to answer this, but I could not resist an accumulator
variant.  Aside from the comments, it is exactly as 1st written [i.e.
it worked properly the first time--Scheme for success!].

-Ken
===========================================================
(define (MANGLE list predicate) 
  (really-mangle predicate (reverse list) '() '())
)

;; should really be local to MANGLE -- then would not have to pass P?.
(define (REALLY-MANGLE p? source result-accum sub-accum)
  (cond
    ((null? source)    ;; result
     (if (null? sub-accum)
         result-accum
         (cons sub-accum result-accum))
    )
    ((p? (car source)) ;; add to result-accumulator
     (really-mangle p?
		    (cdr source)
		    (cons (car source)		;; result-accum
                          (if (null? sub-accum)
			      result-accum
			      (cons sub-accum result-accum)))
		    '())  ;; sublist accumulator starts empty
    )
    (else  ;; add to sublist accumulator
     (really-mangle p? (cdr source) result-accum (cons (car source) sub-accum))
) ) )

;; ---

(define (VOWEL? s) (memq s '(a e i o u)))

(mangle '(a n m n b e f j k l a e) vowel?)
--> (a (n m n b) e (f j k l) a e)

(mangle '(r s a n m n b e f j k l a e r s) vowel?)
--> ((r s) a (n m n b) e (f j k l) a e (r s))

;;			--- E O F ---
From: hal@martigny.ai.mit.EDU (Hal Abelson)
Newsgroups: comp.lang.scheme
Subject: Job announcement: Scheme programming position at MIT
Date: 11 Apr 92 13:20:18 GMT
Article-I.D.: mc.9204110915.aa09487
Reply-To: hal@martigny.ai.mit.edu
Organization: The Internet


The MIT Artificial Intelligence Laboratory has an opening for a
Research Scientist to provide system support for research in symbolic
and numerical computing.  We are seeking an outstanding system
designer who will assume primary responsibility for the continued
development of MIT's implementation of the Scheme dialect of Lisp, and
the associated Unix environment.  Other duties include continuing
research on high-performance implementations of Lisp-like languages,
and supervising students and staff members.  A formal degree
(bachelor's level or higher) in Computer Science is preferred.
Applicants must have experience with Scheme and with Scheme
compilation techniques, and must have developed substantial
applications in Scheme or Lisp.  Applicants must also have extensive
knowledge of Unix, although they should have sufficiently good
programming taste to not consider this an achievement.

MIT is an Affirmative Action/Equal Opportunity Employer.  MIT is a
non-smoking environment.

Please send inquiries to Prof. Hal Abelson, MIT Artificial
Intelligence Laboratory, 545 Technology Square, Cambridge, MA 02139,
hal@ai.mit.edu.
From: gjc@mitech.com (George J. Carrette)
Newsgroups: comp.lang.scheme
Subject: Re: Looking for SIOD (Scheme in One Defun)
Date: 13 Apr 92 09:29:01 GMT
Organization: Mitech Corporation, Concord MA

> Problem is that that the 
> site specified - doesn't have the sources - bu-it.bu.edu  
> (I've looked all over)

BU's anonymous ftp services seem to have gone away. I'm now
providing stuff on world.std.com, who has a nicely organized anonymous
ftp area. For example, you will find various lisp implementations
in ...lisp/, and also ...macintosh/lisp.

The one problem with world.std.com is that it is not reachable
from everyplace on the internet due to NSF net restrictions (world.std.com
is a commercial site, offering timesharing services and a place to
call home for many a displaced hacker).

-gjc

p.s. on the other hand, you may find SCM to be more to your liking.

Newsgroups: comp.lang.scheme
From: ian@syacus.acus.oz.au (Ian Joyner)
Subject: C++ Critique in comp.lang.c++
Organization: ACUS Australian Centre for Unisys Software, Sydney
Date: Wed, 8 Apr 1992 12:10:17 GMT

I have placed a critique of C++ in comp.lang.c++. As the topic of C++ vs
Scheme for teaching courses often comes up, this may be of interest to
readers of this group.
-- 
Ian Joyner                                     ACSNet: ian@syacus.acus.oz
ACUS (Australian Centre for Unisys Software)   Internet: ian@syacus.acus.oz.au
Tel 61-2-390 1328      Fax 61-2-390 1391       UUCP: ...uunet!munnari!syacus.oz
From: bh@anarres.CS.Berkeley.EDU (Brian Harvey)
Newsgroups: comp.lang.scheme
Subject: Neato Scheme programming problem
Date: 16 Apr 92 01:53:44 GMT
Article-I.D.: agate.simn8INN12s
Organization: University of California at Berkeley
NNTP-Posting-Host: anarres.cs.berkeley.edu
Originator: bh@anarres.CS.Berkeley.EDU

I thought up this great problem to put on a quiz for my SICP class but
the TAs convinced me it was too hard, so I'm sharing it with you instead...

Write a function CXR-NAME that takes as its argument a function FN.
This function FN must be some composition of CARs and CDRs.  The value
returned by CXR-NAME should be the appropriate name for FN:

> (cxr-name (lambda (x) (caddr (cddaar (cadadr (cddr (car (caaddr x))))))))
CADDDDAAADADDDAAADDR

Note that CXR-NAME should work for any number of CARs and CDRs, not just
up to four of them.

To save putzing around with symbol->list and all that stuff, you may
assume that you have IMPLODE such that (IMPLODE '(C A D D R)) returns CADDR.

(You may also try the inverse function CXR-FUNCTION but that's much easier.)
From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe)
Newsgroups: comp.lang.scheme
Subject: Re: Scheme release scm4a0 (alpha) available.
Date: 13 Apr 92 23:29:46 GMT
Organization: Comp Sci, RMIT, Melbourne, Australia

In article <JAFFER.92Apr13022119@camelot.ai.mit.edu>, jaffer@zurich.ai.mit.edu (Aubrey Jaffer) writes:
> This message announces the availability of Scheme release scm4a0.
> This directory contains the distribution version 3c of scm.
>   `scm4a0.shar' is a shar file of the C code distribution.
>   `scm4a0.tar.Z' is a compressed tar file of the C code distribution.
>   `slib1b5.shar' is a shar file of a Scheme Library.
>   `slib1b5.tar.Z' is a compressed tar file of a Scheme Library.

What the earlier posting and this posting should have made clearer is
that scm wants slib.  If you run scm without slib in place, it complains
volubly about not being able to find require.scm.  Of course, SLIB is
well worth picking up anyway.

I note that scm3c wanted ftime(), which the BSD manual notes as obsoleted
by gettimeofday(), and which System V Release 3.2 lacks.
-- 
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
From: kho@athena.mit.edu (Karen W Ho)
Newsgroups: comp.lang.scheme
Subject: Re: Scheme use in universities
Date: 15 Apr 92 22:13:21 GMT
Article-I.D.: athena.1992Apr15.221321.20788
Organization: Massachusetts Institute of Technology

I must add (and repeat) that scheme is taught in a requirement class here
at MIT for both computer science and electrical engineering majors. The
name of the class is actually titled, "The Structure and Interpretation of
Computer Programs", and uses scheme to teach many aspects of programming that
will be useful in a computer science career. Personally speaking, I consider
scheme an appropriate language for such a class.

--Karen
Newsgroups: comp.lang.scheme
From: mcleod_s@cs.uwa.oz.au (Steven McLeod)
Subject: Re: Permutations function need
Organization: Dept. Computer Science, University of Western Australia.
Date: Wed, 15 Apr 1992 08:35:51 GMT

In <35115@uflorida.cis.ufl.edu> sab@reef.cis.ufl.edu (Shawn Berg) writes:


>Could someone explain to me how to output, to the screen, all the permutations
>of a list.

>For example if the function is called w/ (1 2 3) the output should be:
>(1 2 3)
>(1 3 2)
>(2 1 3)
>(2 3 1)
>(3 1 2)
>(3 2 1)

>I don't need to deal with nested lists (ie, ((1 2) 3)).

>E-mail please: sab@reef.cis.ufl.edu

I have a solution (from a Com Sci course). Mail me if you want it

Steven McLeod
From: max@Kolmogorov.gac.edu (Max Hailperin)
Newsgroups: comp.lang.scheme
Subject: Teacher education courses (was: Re: New York Times article)
Date: 15 Apr 92 21:04:49 GMT
Article-I.D.: Kolmogor.MAX.92Apr15160449
Reply-To: Max Hailperin <max@nic.gac.edu>
Organization: Gustavus Adolphus College, St. Peter, MN
In-reply-to: bh@anarres.CS.Berkeley.EDU's message of 15 Apr 92 14:34:05 GMTLines: 21

In article <shestINNomr@agate.berkeley.edu> bh@anarres.CS.Berkeley.EDU
 (Brian Harvey) writes:

   Is anyone besides me an Iain interested in this discussion?  Or should we
   move it over to comp.edu or something?

I for one am interested, in part because I'm working on designing a
computer science course specifically targeted at education majors,
i.e. future teachers at the pre-college level.

I've already asked Terry Kaufman for his input, and am planning on
sending Iain Ferguson some email in the next day or two, as soon as I
get a moment to organize my thoughts.  But, Brian Harvey's posting
gives me the perfect lead-in to ask:

Has anyone on this list/newsgroup any experience with noteworthy
courses aimed at future teachers?  Or any non-routine thoughts about
what such a course should be like?  If so, please reply to me by
email.  (I'd be happy to provide a summary to anybody else who's
interested, just ask.  Respondants: please let me know if you don't
want your replies redistributed.)
Newsgroups: comp.lang.scheme
From: pnm@goanna.cs.rmit.oz.au (Paul Big-Ears Menon)
Newsgroups: comp.lang.scheme
Subject: MacScheme Folks.  Anyone home???
Date: 15 Apr 92 07:19:04 GMT
Organization: Comp Sci, RMIT, Melbourne, Australia

hi,
  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.

  Could someone please email me LightShip's fax #, address or a phone
  number which is answered by a human?

  I have a very old (circa '88) manual (I have upgraded to V 2.0 of the SW), 
  no native code compiler (it IS MacScheme & Toolsmith), and have trouble 
  running under Mac's System 7 (in 32 bit mode).

  Help.

    Paul Menon,
    Dept of Computer Science,
    Royal Melbourne Institute of Technology, 
    124 Latrobe Street,
    Melbourne 3001, 
    Victoria, Australia.

email:	pnm@goanna.cs.rmit.oz.au
PH:	+61 3 660 3209
FAX:	+61 3 662 1617