HDTenEightyP/NetNews huggingface dataset:
From: markf@zurich.ai.mit.edu (Mark Friedman)
Newsgroups: comp.lang.scheme
Subject: Re: wots going on here!?
Date: 5 Sep 92 00:36:37 GMT
	<17tn1uINNkij@early-bird.think.com>
	<JINX.92Aug31170432@chamarti.ai.mit.edu> <xwjn+h#.thinman@netcom.com>
Reply-To: markf@zurich.ai.mit.edu
Organization: M.I.T. Artificial Intelligence Lab.
In-reply-to: thinman@netcom.com's message of 1 Sep 92 17:33:32 GMT

In article <xwjn+h#.thinman@netcom.com> thinman@netcom.com (Technically Sweet) writes:

** From: thinman@netcom.com (Technically Sweet)
** Date: 1 Sep 92 17:33:32 GMT
** References: <1187.9208311520@subnode.aiai.ed.ac.uk> <17timvINN7b8@agate.berkeley.edu> 	<17tn1uINNkij@early-bird.think.com> <JINX.92Aug31170432@chamarti.ai.mit.edu>
** 
** jinx@zurich.ai.mit.edu (Guillermo J. Rozas) writes:
** > [ purposefully erroneous code deleted ]
** 
** >(bar 23)
** >;The object #[undefined-value] is not applicable.
** >;To continue, call RESTART with an option number:
** >; (RESTART 2) => Specify a procedure to use in its place.
** >; (RESTART 1) => Return to read-eval-print level 1.
** 
** >Of course, you can also invoke (DEBUG).
** 
** Yes, Mr. Jinx, but where does it SAY that you can invoke (DEBUG)?
** DO YOU GET THE POINT YET?

If you mean where does the MIT Scheme user manual say it, then you are
relating a well known deficiency of the MIT Scheme documentation. I
suspect, however, that you are complaining that the error message does
not tell you that you can invoke the debugger. Well one reason that it
doesn't say this is that you can ALWAYS invoke the debugger. Perhaps
new users need to be reminded of this but it would hardly be
informative to anybody else.

-Mark
--

Mark Friedman
42 Wyatt St.
Somerville, Ma. 02143

markf@zurich.ai.mit.edu
From: bh@anarres.CS.Berkeley.EDU (Brian Harvey)
Newsgroups: comp.lang.scheme
Subject: Re: wots going on here!?
Date: 6 Sep 1992 14:53:07 GMT
Organization: University of California at Berkeley
NNTP-Posting-Host: anarres.cs.berkeley.edu

goudal@labri.greco-prog.fr (Frederic GOUDAL) writes:
>The problem in Scheme, as I use it, is that it is not a very interesting
>information as I use a lot of continuation passing style and what I
>call "next function passing style" (as expanders in EPS) so I have a
>lot of anonymous functions, and a lot closure coming from the same
>lambda expression.

Yes, it's true that Scheme functions don't always have names.  But CPS
is not something that beginners do in their first 24 hours of Scheme
programming.  My point is that the debugging facilities in a language
ought to be designed with those first 24 hours as the most important
consideration.  Experienced programmers will find a way to debug;
why, when I was a child we read octal core dumps!  :-)  Beginners get
confused and frightened and drop the course.

It's especially good if, as in some Schemes, each function has its own
idea of its own name within itself (e.g., the (define (foo baz) body)
syntax expands to some kind of named-lambda) so that the error message
can give a name that's meaningful to the user even if that name isn't
part of the current environment at the time of the error.  With a little
effort we could probably even invent internal names such as
unnamed-lambda-within-function-FOO that could usefully appear in
error messages.
Xref: sparky comp.lang.scheme:2163 comp.theory:1884 alt.lang.ml:61
From: ajtd@honey.st-and.ac.uk (Tony Davie)
Newsgroups: comp.lang.scheme,comp.theory,alt.lang.ml
Subject: functional bibliography
Date: 7 Sep 92 16:16:23 GMT
Organization: St.Andrews University

Hello,
Enough people expressed interest in a text-only copy of my functional
bibliography that I have made one and placed it at /pub/staple/pubs.txt
on our anonymous ftp machine tamdhu@dcs.st-and.ac.uk

It's in a kind of bastard refer format and uses %T for a title, %A for authors
%I for a unique index entry, %S for the source (which may be a reference to
another index --- that's the penalty for not using hypercard!), %K for
keywords and %C for comments.

I would be glad to receive errors, omissions and new entries.

Tony Davie
From: jinx@zurich.ai.mit.edu (Guillermo J. Rozas)
Newsgroups: comp.lang.scheme
Subject: Re: wots going on here!?
Date: 5 Sep 92 11:04:31 GMT
	<17tn1uINNkij@early-bird.think.com>
	<JINX.92Aug31170432@chamarti.ai.mit.edu> <xwjn+h#.thinman@netcom.com>
	<MARKF.92Sep4203637@montreux.ai.mit.edu>
Reply-To: jinx@zurich.ai.mit.edu
Organization: M.I.T. Artificial Intelligence Lab.
In-reply-to: markf@zurich.ai.mit.edu's message of 5 Sep 92 00:36:37 GMT

In article <MARKF.92Sep4203637@montreux.ai.mit.edu> markf@zurich.ai.mit.edu (Mark Friedman) writes:

|   ** Yes, Mr. Jinx, but where does it SAY that you can invoke (DEBUG)?
|   ** DO YOU GET THE POINT YET?
|
|   If you mean where does the MIT Scheme user manual say it, then you are
|   relating a well known deficiency of the MIT Scheme documentation. I
|   suspect, however, that you are complaining that the error message does
|   not tell you that you can invoke the debugger. Well one reason that it
|   doesn't say this is that you can ALWAYS invoke the debugger. Perhaps
|   new users need to be reminded of this but it would hardly be
|   informative to anybody else.
|

You are right that it is not on the language reference manual, but,
although the debugger is not fully described in it, there is a little
section on it in the user's manual.
Newsgroups: comp.lang.scheme
From: rmg53668@uxa.cso.uiuc.edu (Ryan M. Grant)
Subject: MSDOS scheme programs
Organization: University of Illinois at Urbana
Date: Sat, 5 Sep 1992 02:59:35 GMT

I am looking for a scheme compiler or interpreter for MSDOS PCs.
I am aware of PC Scheme but was wondering what else exists.
I am running a 386 w/387 and 4MB RAM.
	Is PC Scheme the best?
	Is it complete enough for a CS intro course?
	Is it buggy or reliable?

Thanks,
- Ryan Grant
cs125b64@sumter.cso.uiuc.edu
From: sm86+@andrew.cmu.edu (Stefan Monnier)
Newsgroups: comp.lang.scheme
Subject: Re: trampolines
Date: 4 Sep 92 16:27:34 GMT
Article-I.D.: andrew.Iedzvq_00VIBMC7kwP
Organization: Junior, Math/Computer Science, Carnegie Mellon, Pittsburgh, PA

Excerpts from netnews.comp.lang.scheme: 4-Sep-92 trampolines Jonathan H.
N. Chin@csug (2303)
> Ignoring promises that refer to their own values, it seems that the
> above code would after the first "force" always have to perform a
> redundant `if' test of `result-ready?'.  I should have thought that
> this requirement could be removed, and the code I have tried seems to
> do this:

> (define make-trampoline
>   (lambda (proc)
>     (letrec ((the-promise (lambda()
>                             (let ((result (proc)))
>                               (begin
>                                 (set! the-promise (lambda()
>                                                     result))
>                                 result)))))
>       the-promise)))

> where `make-trampoline' is used in place of `make-promise'.
> (aside: what would be a reasonable way to reformat the above?)

> How would I need to modify this code to encompass promises that refer
> to their own values?

> Thanks in advance,
> Jonathan

The problem here, is that the final 'the-promise' returns
the value of 'the-promise' but not 'the-promise' itself.

Now, imagine, you use that function. You get a promise
You call it x. When you want to get his value, you force
it by (x). The application of x will change the value of 'the-promise'
but not that of x !!!
So that at next (x), the same processing will be done

This way, you don't need the 'if ready' but you also evaluate
each time from scratch !
It is not delayed-evaluation !

Bad Luck !

	Stefan Monnier

PS: the R4RS version is not really stupid ! a better scheme-only
	version is difficult to do !

-----------------------------------------------------
-- On the average, people seem to be acting normal --
-----------------------------------------------------
From: reye@qut.edu.au
Newsgroups: comp.lang.scheme
Subject: PC-Scheme fails on 486's
Date: 4 Sep 92 13:25:39 EST
Organization: Queensland University of Technology

Can anyone tell me why PC-Scheme (v. 3.02) runs ok on 386's, but not on 486's?
We've tried various brands of 486's, without success.  On a 486, the error
message (for valid program statements) is usually:

	    [Syntax Error] Expression has too many subexpressions.

Looked at the most recent FAQ list, but it doesn't state any restrictions for
PC-Scheme.  What causes the error?  Is there a patch, or do people use a
different PC implementation of Scheme.

Jim Reye
School of Information Systems
QUT
Australia
Newsgroups: comp.lang.scheme
From: dsomerv@ra.cs.umb.EDU (Daniel Somerville)
Subject: MIT Scheme availability ?
Organization: The Internet
Date: Mon, 14 Sep 1992 13:49:35 GMT


Are there any versions, preferably the one you're proudest of, of Scheme
for use on a sun4 (or perhaps other machines) that are available free
via ftp  ?

I'm teaching a course at UMB that uses Scheme, and would like to
try your implementation... which I understand has undergone some
real improvements of late.

Thanks,
Dan Somerville

dsomerv@cs.umb.edu
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Newsgroups: comp.lang.scheme
Subject: Scheme Library slib1b10 released.
Date: 14 Sep 92 05:45:13 GMT
Organization: M.I.T. Artificial Intelligence Lab.

This message announces the availability of Scheme Library release
slib1b10.

New in release slib1b10 are: dynamic-wind, transcript-on,
transcript-off, with-input-from-file, and with-output-to-file.  From
kend@data.rain.com are collect.scm and an updated oop.scm (now called
yasos.scm).  From: Stephen J. Bevan <bevan@cs.man.ac.uk> is elk.init.

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

SLIB includes initialization files for ELK 1.5, GAMBIT, MITScheme,
scheme->C, Scheme48, and T3.1.  Scm4a 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/slib1b10.tar.Z
nexus.yorku.ca:pub/scheme/new/slib1b10.tar.Z

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

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

Remember to use binary mode when transferring the *.tar.Z files.
From: jinx@zurich.ai.mit.edu (Guillermo J. Rozas)
Newsgroups: comp.lang.scheme
Subject: Re: MIT Scheme on Sparc?
Date: 5 Sep 92 23:59:06 GMT
Reply-To: jinx@zurich.ai.mit.edu
Organization: M.I.T. Artificial Intelligence Lab.
In-reply-to: ark@alice.att.com's message of 5 Sep 92 15:05:34 GMT

In article <23633@alice.att.com> ark@alice.att.com (Andrew Koenig) writes:

|   Last time I checked (which was probably at least a eyar ago),
|   MIT Scheme didn't run on Sparcstations.  Has that changed?
|   -- 

It depends on what you mean.

The 7.1 release runs on Sparcs, but completely interpreted (there is
no back end for the compiler).

A compiler back end for the Sparc is _not_ on the queue.  However, you
are welcome to write one.  There is a 100+ page document on porting
the compiler to other architectures (there are currently 6 complete
back ends and one more under work), and we will be happy to provide
some assistance.


Newsgroups: comp.lang.scheme
From: IIC1112@malloco.ing.puc.cl (AyudantesIIC1112)
Subject: Want a good Scheme for PC
Organization: Departamento de Computacion, Universidad Catolica de Chile
Date: Mon, 14 Sep 1992 15:55:09 GMT


Hi everyone. I'd like info on a good Scheme for MS-DOS computers. Actually
I have PC Scheme 3.03, but it is *LOUSY* (particullarly the editor).

The new Scheme interpreter should be able to run on 8086..80486 machines
with MS-DOS 3.3 .. 5.0 . 

I hope some of you can point one to me. Thanks in advance.

                                                          MIGUEL FARAH
                                                          14/9/1992
From: shrchin@csug.cs.reading.ac.uk (Jonathan H. N. Chin)
Newsgroups: comp.lang.scheme
Subject: Re: Trampolines
Date: 9 Sep 92 03:36:39 GMT
Organization: University of Reading

Thanks to Stefan for his answers to some of my queries.
Anyone willing to answer the rest of them?

Thanks,
Jonathan
-- 
Jonathan H N Chin (9 kyu) \ Dept. of Cybernetics, \ "Respondeo, etsi mutabor"
shrchin@uk.ac.rdg.susssys1 \ University of Reading \
bq305@cleveland.freenet.edu \ Box 225, Whiteknights \ < Rosenstock-Huessy >
jockstrap,mandy@CyberSpaceII \ Reading, RG6 2AY, U K \
Newsgroups: comp.lang.scheme
From: surowka@usctoux1.cto.us.EDU.pl ("Wojciech Surowka"@usctoux1.cto.us.edu.pl,
        Instytut Matematyki)
Subject: Xscheme
X-Unparsable-Date: Mon, 14 Sep 92 10: 33:29 cet
Reply-To: surowka@usctoux1.cto.us.edu.pl
Organization: The Internet
Date: Mon, 14 Sep 1992 08:55:52 GMT

What's the current state of Xscheme? As far as I know, the latest version is
0.28. Am I right?
-- 
Wojciech Surowka
surowka@usctoux1.cto.us.edu.pl
From: goudal@labri.greco-prog.fr (Frederic GOUDAL)
Newsgroups: comp.lang.scheme
Subject: Re: wots going on here!?
Date: 5 Sep 92 07:54:45 GMT
Organization: GRECO Programmation du CNRS - Bordeaux,France

In article <17timvINN7b8@agate.berkeley.edu>, bh@anarres.CS.Berkeley.EDU (Brian Harvey) writes:
|> P.S.  Yes of course if an error happens inside a procedure you should be
|> told its name.  My example was too simple, I guess.  What Logo does on
|> an error is tell you the error, the procedure in which it happened, and
|> the line of the procedure definition that contains the error.

The problem in Scheme, as I use it, is that it is not a very interesting
information as I use a lot of continuation passing style and what I
call "next function passing style" (as expanders in EPS) so I have a
lot of anonymous functions, and a lot closure coming from the same
lambda expression.


-- 

goudal@geocub.greco-prog.fr          "Why can't we reach the sun?"
oral-mail : babbs			 Pink Floyd
Newsgroups: comp.lang.scheme
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Subject: SCM and SLIB shar files
Organization: M.I.T. Artificial Intelligence Lab.
Date: Wed, 9 Sep 1992 04:26:15 GMT

Does anyone use the shar files I place on
altdorf.ai.mit.edu:archive/scm/ or nexus.yorku.ca:pub/scheme/new/ ?

If not, I will place just the tar.Z files there.
Newsgroups: comp.lang.scheme
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Subject: patch for scm4a11
Organization: M.I.T. Artificial Intelligence Lab.
Distribution: comp
Date: Wed, 9 Sep 1992 04:12:17 GMT

From: robt@is.morgan.com (Rob Torop)
(/ 1 1+i) gives a bus error on some systems.  Here is the patch:
camelot>diff -c scl.c~ scl.c
*** scl.c~	Wed Aug 26 21:35:35 1992
--- scl.c	Tue Sep  8 23:04:31 1992
***************
*** 809,816 ****
  	double r=REAL(y),i=IMAG(y);
  	long a=INUM(x);
  	double d=r*r+i*i;
- 	if CPLXP(x)
- 	  return makdbl((a*r+IMAG(x)*i)/d,(IMAG(x)*r-a*i)/d);
  	return makdbl((a*r)/d,(-a*i)/d);
        }
        return makdbl(INUM(x)/REALPART(y) ,0.0);
--- 809,814 ----
Newsgroups: comp.lang.scheme
From: ark@alice.att.com (Andrew Koenig)
Newsgroups: comp.lang.scheme
Subject: MIT Scheme on Sparc?
Date: 5 Sep 92 15:05:34 GMT
Organization: AT&T Bell Laboratories, Murray Hill NJ

Last time I checked (which was probably at least a eyar ago),
MIT Scheme didn't run on Sparcstations.  Has that changed?
-- 
				--Andrew Koenig
				  ark@europa.att.com
Newsgroups: comp.lang.scheme
From: jeff@aiai.edinburgh.ac.UK (Jeff Dalton)
Subject: Re: Scheme or TCL?
Organization: The Internet
Date: Mon, 7 Sep 1992 12:20:11 GMT

What is TCL/TK?

How could Scheme be substituted for it?
Newsgroups: comp.lang.scheme
From: gumby@Cygnus.COM (David V. Henkel-Wallace)
Subject: new age languages
Organization: Cygnus Support, Palo Alto, California
Date: 15 Sep 92 13:40:11

   Date: 15 Sep 92 10:34:45 GMT
   From: gjc@mitech.com (George J. Carrette)

   In a way, what happened is that CL and Scheme went one-up on FORTRAN-77
   in terms of its numeric support. Saints preserve us if a significant
   number of hackers here start taking looks at FORTRAN-90!

I have in front of me a NASA communique encouraging me to upgrade all
my programs to the new standard.  It lists the major improvements in
Fortran 90.  First on the list is the change in name from "FORTRAN" to
"Fortran".   

I guess case sensitivity is the result of a kindler, gentler unix nation.
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Newsgroups: comp.lang.scheme
Subject: SLIB update
Date: 15 Sep 92 16:46:47 GMT
Organization: M.I.T. Artificial Intelligence Lab.

I inadvertantly left yasos.doc (formerly oop.doc) out of the slib
distribution.  I have put new versions including yasos.doc on
altdorf.ai.mit.edu:archive/scm/slib1b10.tar.Z
nexus.yorku.ca:pub/scheme/new/slib1b10.tar.Z
From: gjc@mitech.com (George J. Carrette)
Newsgroups: comp.lang.scheme
Subject: Re: What I learned from building Dylan/Thomas
Date: 15 Sep 92 10:34:45 GMT
Organization: Mitech Corporation, Concord MA

In article <9209142230.AA20554@peanut.crl.dec.com>, jmiller@crl.DEC.COM writes:
The
> ... symbolic algebra system at the end of Chapter 2 of Structure and
> Interpretation takes this much farther, 

I could understand that ok.

> but perhaps at the expense of
> the gut-level understanding of the issue that comes from simply asking
> the question "How does Scheme do that with its numbers, anyway?".

To tell the truth, I could never really understand that. You see,
"how does XXX do it" begs the question completely of "why does XXX do YYY?"

  [Maybe the Math Dept at MIT help fry my brain.]

In a way, what happened is that CL and Scheme went one-up on FORTRAN-77
in terms of its numeric support. Saints preserve us if a significant
number of hackers here start taking looks at FORTRAN-90!

-gjc
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Newsgroups: comp.lang.scheme
Subject: scm4a11 Scheme release available.
Date: 6 Sep 92 04:31:51 GMT
Organization: M.I.T. Artificial Intelligence Lab.

This message announces the availability of Scheme release scm4a11.

The distribution files now unpack into directory scm.  A recently
introduced bug with (>= 1 3 2) has been fixed.  Support for Linux has
been added.  Interrupts now work much better under VMS.  Speed of LET
has been improved.

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/scm4a11.shar
altdorf.ai.mit.edu:archive/scm/scm4a11.tar.Z
nexus.yorku.ca:pub/scheme/new/scm4a11.shar
nexus.yorku.ca:pub/scheme/new/scm4a11.tar.Z

SLIB is a portable scheme library which SCM uses:
altdorf.ai.mit.edu:archive/scm/slib1b9.shar
altdorf.ai.mit.edu:archive/scm/slib1b9.tar.Z
nexus.yorku.ca:pub/scheme/new/slib1b9.shar
nexus.yorku.ca:pub/scheme/new/slib1b9.tar.Z

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

This directory contains the distribution version 4a11 of scm.
  `scm4a11.shar' is a shar file of the C code distribution.
  `scm4a11.tar.Z' is a compressed tar file of the C code distribution.
  `slib1b9.shar' is a shar file of a Scheme Library.
  `slib1b9.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 scm4a11.shar and scm4a11.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.
Net 30 day purchase orders are minimum $100.

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).
From: shrchin@csug.cs.reading.ac.uk (Jonathan H. N. Chin)
Newsgroups: comp.lang.scheme
Subject: trampolines
Date: 4 Sep 92 19:59:12 GMT
Organization: University of Reading

I'm teaching myself scheme and am currently looking at `delay' and
`force'. The sample definition of `make-promise' in R^4 is:

(define make-promise
  (lambda (proc)
    (let ((result-ready? #f)
          (result #f))
      (lambda ()
        (if result-ready?
            result
            (let ((x (proc)))
              (if result-ready?
                  result
                  (begin (set! result-ready? #t)
                         (set result x)
                         result))))))))

I believe the rationale for the second `if' to be that the promise
may refer to its own value. My first question then is what prevents
an infinite stack of calls of `proc' from forming, where `proc' is, I
believe, the promise? Is it just a case of making sure that the
promise itself terminates, or does `make-promise' contain some subtle
device that ensures termination which I have overlooked?

Ignoring promises that refer to their own values, it seems that the
above code would after the first "force" always have to perform a
redundant `if' test of `result-ready?'.  I should have thought that
this requirement could be removed, and the code I have tried seems to
do this:

(define make-trampoline
  (lambda (proc)
    (letrec ((the-promise (lambda()
                            (let ((result (proc)))
                              (begin
                                (set! the-promise (lambda()
                                                    result))
                                result)))))
      the-promise)))

where `make-trampoline' is used in place of `make-promise'.
(aside: what would be a reasonable way to reformat the above?)

How would I need to modify this code to encompass promises that refer
to their own values?

Thanks in advance,
Jonathan
--
Jonathan H N Chin (9 kyu) \ Dept. of Cybernetics, \ "Respondeo, etsi mutabor"
shrchin@uk.ac.rdg.susssys1 \ University of Reading \
bq305@cleveland.freenet.edu \ Box 225, Whiteknights \ < Rosenstock-Huessy >
jockstrap,mandy@CyberSpaceII \ Reading, RG6 2AY, U K \
-- 
Jonathan H N Chin (9 kyu) \ Dept. of Cybernetics, \ "Respondeo, etsi mutabor"
shrchin@uk.ac.rdg.susssys1 \ University of Reading \
bq305@cleveland.freenet.edu \ Box 225, Whiteknights \ < Rosenstock-Huessy >
jockstrap,mandy@CyberSpaceII \ Reading, RG6 2AY, U K \
Newsgroups: comp.lang.scheme
From: mewes@selway.umt.edu (Jim Mewes)
Subject: Need help starting the X windows interface
Keywords: X windows
Organization: University of Montana
Distribution: usa
Date: Thu, 10 Sep 1992 18:02:13 GMT

We're having trouble starting the X windows interface.  Our server is a
DECstation 5000/120 and the client is a DECsystem 5500.  We set the
DISPLAY variable (setenv DISPLAY node:0.0), start scheme, enter (x), 
and get the following results ...

   unix > scheme -edwin
   Scheme Microcode Version 11.59
   MIT Scheme running under Ultrix
   Type `^C' (control-C) followed by `H' to obtain information about interrupts.


   Scheme saved on Tuesday October 15, 1991 at 7:06:25 PM
     Release 7.1.3
     Microcode 11.59
     Runtime 14.104
     Edwin 3.24

   1 ]=> (x)

   Unbound variable x
   ;Package: (user)

   2 Error-> 

Are we leaving out a step?  Are there any tricks required to start up the 
X interface? 

--

Jim Mewes                               mewes@selway.umt.edu
ULTRIX Administration                   University of Montana
-- 

Jim Mewes                               mewes@selway.umt.edu
ULTRIX Administration                   University of Montana
Newsgroups: comp.human-factors