UWVFP(FP0؋F&O F&G&G < ʋЋƋ$6&~&6&F&9EtL2p P3PF&EĞ&(6&>p t*6&>v t
T F&EF  ,6&> ~F  vFĞ&^&9~ Ì~ڹ- F*Ftz8ftF^&8Gui~ tF^&8GuWF+F;F| F9Fu~ tF@t8F^&8Gt,F+F;F~<.6&> t0^&GĞ&v&@F[FF,6&9~2F^&8GuFuӋvzvĞ&7X06&?&& DPĞ&& & 	26&>| u46&z  66& ^&Gȋƻ[ ؎86&>&I86&&a~ t;F*PĞ&& & 	46&z  F*Pv:6&&ud26&>| u46&z  Ğ&& & 	<6&6&6`	 P,>6&F&Ht8PP
|FPPh
P :6&6&6P
|FPPh
P *6&>v t	 B l PP ]	@6&6&6`Ğ&& & 	pP 	B6&R&TĞ&7FD6&FF6& fĞ&7FtH6&&J6&H6&J6& f% = ؎L6&FD6&FF6& ^_]ːU VN6&6 &6rP
N6&6 &6"P
vPrPh
P"Ph
FPrPXX@uNFP"PXX@uQN6&6 &6"P
P6&6(&6&"Ph
FP"PXX@u FV9Vv r9Fv ~ } 	~[s  PrPCu Ɔr  PrPVj36d6brP
udp P~QPVj3FPF- P86&6&6VPR6& [ RPFV-  RP,6&V2^]U WV+PP(FVN6&6 &6FP
N6&6 &64P
PFPh
P4Ph
FP4PXX@uQN6&6 &64P
P6&6(&6&4Ph
FP4PXX@u3FV9Vw1r9Fs*FVFV06&X& & 	FVFVFVPPFPCu  P6d6bVh4p P~QPVh43,602&9?~Dv3ɉNރ,.&Gt&u&g[GĞ0&9?ЋvFP[ Ğ0&/P86&6&6VWV2FPFPR^_]ːUTWVN6&6 &6FP
PFPh
PFPVt)FPV Qp Q~RQxWV^_]ːU"WVFP(FP0V< &m&EFT6&F&M FF&EF  ~,6&F 86&& ؉V$6&FN9Nu ~ t	F&-------------------------------------

;;; *EOF*
JF&G9F
tF&D8Fu0Fw&F;FF&@t +~9~~~[A9N~a~} +FFf~@~F 39N 86&&> ؉V~؃~ tFw&uZFw&*FtJF&F
t	F&8Eu4Fw&F
t	F&8EuFw&FF;F}F[A9N~V~ t} ^_]ːear all searchU WVPVt5P 6	u$FPVVP
VP ƆV PVPh
FPVPXXt$VPP(P P~W PVuP(P P P-PVP26	
FVu$VP0P(P PvvW PvV;t2VPLP(Pvv Pvvt$VPwP(P PF
 3RT&7&GLX"3NP&&G&<pt#pPWP(P PĞN&&WVF ~> MVv~~؎ZX& &+ǋV& &PIuvĞN&F&7&GĞR&&&GÌ V&$3&	&> 
&
&	ߎ&&3&OF&&&ʋH(3JL&&G*3&&F&ʋFPQ"@F ĞJ&&?~G~ VvN~& &+ǋV& &PAĞJ&&9ڋ~v*3&F&7&GĞJ&&@&GF,3&>
&
M.3&& ^_]ː&u0U.WV4Z9&  3\9&6^9&"`9&b9&r
d9&bf9&dh9&fj9&h+ɉNNvvZ 	RP"PrQP
V^V۹ ^VNV l9&>n u-n9&X&B&@	"P|	3brQPt~
 PvvPt!2PP ]	p9&tN 릐2PP ]	p9&u,
QP2PP ]	p9&u0~+PP(FV P+PP(ȋ+FV~9&&SQvvvVr	FV~9&&d 3SQRPFVd RPvvFVvvRP< RPSQRPvv⚺RPFމVTSQvvމFډVܚT< 3SQvvF։Vؚquest@cs.cmu.edu. Bugs should be sent to   elp-bugs@cs.cmu.edu.See the Scheme FAQ for information on implementations of Prolog in Scheme.----------------------------------------------------------------;;; *EOF*^&? tMt9&>v tA P Pv9&68&66`  Px9&GPv9&68&66 t ظ[ .ظ&&،F&Gt1&9}&Gع&;z
~36&z
F&9G|&Fu
&> tF&Gu
&
t~ u
&> tF&Gt
&
u PvvPt}pr9^F&? tMt9&>v tA P Pv9&68&66`  Px9&JPv9&68&66+PP(FVz9&>| u|9&z  ,
QP|%^&? tMt9&>v tA P Pv9&68&66`  Px9&GPv9&68&66 Pvv P n9&X&F&D	 Pvv Pr9&>p tMt9&>v tA P Pv9&68&66`  Px9&GPv9&68&66 ^_]UWV P3Z9& P
QP9+& &
~u19&9>"t2PP ]	p9&u
|]	u9& 9&F|#[ n9&&@t9&  2P
P ]	=tz9&>| u|9&z  r9&>p tt9&>v tT 9&>" t2PP ]	p9&tt 3P t 9&N&Ltsd P 	FV|]	t6~vv` 	u!d P 	FV]	|]	u͚]	3P9&6N&6L tmpP 	FVRP` 	tP~|]	t@2P
P ]	=t*	vv` 	t	3b2PP ]	p9&t;3PN ^9&>" u\9&>6 u`9&> t N ( ^_]ːU WV9
&? |%[ &/9&&~ڹ- Ğ
&? } ^9&>" t5~ t/F*Pn9&X&N&L	F*P3~9&& t1B*PWn9&X&R&P	
B*PFF;r`9&? u\9&>6 t?Ğ
&? |5~ t/F*Pn9&X&V&T	F*PO9&&uĞ&? u\9&>6 u^9&>" u n9&X&Z&X	9&6&6`	 P,9&6&6P
Ğ
&? |FPPh
 P  PP ]	n9&X&^&\	9&6&6`pP 	9&R&T3^9&"\9&6Ğ&^_]ːU욀"P9&6&6n9&X&&	9&6&6`嚖t9&>v t9&63P]	9&>L tr9&>d u.]	v]UVvu3,ȋƙ+T؋ʙùd P 	^]ːUWV~9&B&DF&9Eu	&9U
u&E
&Eu
9&& 9&6&6KP
KP"KF^F  9& & u ~N؋W&9Du&9T
tGGu 9&&Vu VV&? u$~9&> t3"PvW ~^FFG&< u^&7"PvW_9&6&6KP
KP"K^9&F&9t&9&> uF&5"PDvP
K^_]ːUt9&>v ur9&>p u3P,9&@P"PrQP
 P Q9&6&6` rQP9&6&6Z 9&@P9&6
"PrQP
 P P9&6&6` rQP9&6&6Z  9&bFt'P9&6&6"PrQP$9&6&6#PrQP P Q9&6&6` #P9&6&6Z  P P9&6&6` rQP9&6&6Z 3P9&6^ 	]ːt9&>v t&r9&>p t  P9&6&6 ːU.WV~FL^ }dǹ[ FԻ9^֌F&&GtFLBƌ@V~ t	F& ^&^&GtFF&C~ t
FF& ^&^&GtFF&D~ t
FF& ~ t$^&^&G@tFF&FFF& ^&^&GtFF&H~ t
FF& ^&^&GtFF&K~ t
FF& ^&^&GtyFF&L~ ti^&^&GF|@P+#+FP0#PFP
FڌҋȎڋ6? t!vNG^F&= uv~~ t$^&^&GtFF&MFF& ^&^&GtFF&N~ t
FF& ^&^&GtFF&S~ t
FF& ^&^&G tFF&R~ t
FF& ~ t^~&=&At
FF&XF& FL^_]ÐUt9&>v u r9&>p u 9&> u3P9&6+RP9&@P5#PrQP
 P Q9&6&6` rQP9&6&6Z 
 P P9&6&6` vv9&6&6Z T ]U WV3Pz9`b&? }Tt9&>v uEWĞ`&@PXn9\^&&f&ddP P P9XZ&w&7` dPĞX&w&7Z  PĞ`&7؋F&? tTPVĞ\&&j&hdP PPĞX&w&7` dPĞX&w&7Z 9TV&G&u9&w&7dP
A#PdPh
 PJ#PdP26	
Vu FPV QQNQFWV~ u vrĞT&w&7dP
M#PdPh
3PdQNQ* 6	
uqvFP; PdPFP* 6	
t@2 P PĞX&w&7` Ğ\&&n&lĞX&w&7Z T ^_]R$bCLS U.WV4 ع 4&
  &QP(4+&,&*&(&0&.p4^F&9t&4&9vt4&X&& F4^&? u - ~ٹ ~ t%FFF  4&F~FF  FP	RP4&6 &6 
PrQPrQPBFP	RP
PrQPrQPBF~js)+FFFFFF4^ތF&4&>v% 4^ڌF&4&>x^&4&
4&9s4&>  t^&3PN։VRQ QD~ u 
QP P	tuHtpHtHHtMcuW^&^&ub 4&h4&d4&X&&	뤚u
^&^&u2봎4&h 3P4&T 4&h t
F҉NԐ3^&9?~14&t&4	QPFuG^&9?ҚHu HuGHtvHu }W4&t
 ;E2PP ]	4&u)FP P	3Pvvָ P4&u^&^&t 4&d4&h4&X&&	u^&^&t밐62PP ]	4&u_4&> tPFP P	3Pvvָ P"2PP ]	4&uFFP Q	F  4&^&? tp4&>v td4&6&6
PrQP
 P P4&6&6` rQP4&6&6Z T 4&h 3PO
QP P	4&^&? tp4&>v td4&6&6
PrQP
 P P4&6&6` rQP4&6&6Z T 4&T4&h  
QP P	4&^&? tp4&>v td4&6&6
PrQP
 P P4&6&6` rQP4&6&6Z T 3P 5&	 5&b4&d5&f4&h Pvvָ Pf3Pvvָ PQ^_]WV+ 




&&r
&&6&"&&
& ع ^_ːUVXP 	FVRP` 	uuv2PP ]	4&tY	uP2PP ]	 tFF&
t*<t&P]		vv` 	t '2PP ]	:]	
 P	]	3^]ːU(WVb5&? u]v
vrsions for CLX, Express
Windows, NCW, CLUE, CLM/GINA, Common Windows, LispView, Winterp, CLIM
and YY. Several implementations have a mouse sensitivity feature and
others have implementation-specific features.  A copy has been made
available from the Lisp Utilities Repository. For further information,
contact Masayuki Ida <ida@csrl.aoyama.ac.jp>.

----------------------------------------------------------------
;;; *EOF*

4&X&>&<	UFPVFPbPh
bPP<uX9Ft!bP4&X&B&@	FDF^FFV
~ ~ t+v
vZ 	RP4&X&F&D	PB>F uy396F~%D Pv
vWd
t
F;6F|96F/~ u=v
vZ 	RP4&X&J&H~F
&} t=&u&uvviPbPF
&uyPFP
2vvbP
F
&u&uPFPF? t5&6&6bP
FPbPh
  F;6F}rFFFFDFDFF+ƉF~vF^ ^F^FFFNuFbPBu$9FubP4&X&N&L?~ u bP4&X&R&P	 5&&u Ğ&7PPbPPbPRPD5&&t-Ğ&7PPbPbPB3^_]U($
5^ތF&? u 5^ڌF&G&u t66` 	u d P 	5&bFtP^&w&7PNFP^&w&7PNFPFPNFPXXuDNFPB^&74&X&&	5&z  ^&7]39&RzLxL9&9ptI9&9vt> PP9&6&6` #P9&6&6Z T #P|	]	9&$PP ]	 Pu 9&X&N&L	3n9&>p tJ9&>v t> PP9&6&6` #P9&6&6Z T $P|	 PV39&RzLxL9&9ptH9&9vt= PP9&6&6` &$P9&6&6Z T 
H$P|	:]	9&$PP ]	3PNtz9&>p tK9&>v t? PP9&6&6` S$P9&6&6Z T u$P|	3P u4^ːUWV9&
&
VȋڀFV$PSQ
$PvW
QPr9&QPZ 	RP$P	9&QPZ 	RPvW'3FF9&9~Q~9&9>t,$PvvPVZ 	RPvvG9&9>~$PvW89^F+&G&9Ft
QP:'~ uZzL0QP:~9^&G&t- P&w&7vv<
^&G SvW%$PvW~ t)9&>^ u9&>` t$6$1$+9&t$PvW9&u$PvW$PvW9&>بt+&~ u:&#Ft &ِFt vt
 &6بt$`~ t6 t$PvW t$PvWƨt3$" t$ t$
ƨt$PvW9&t~ t9&>z u$PvW$PvW$PvWw$PvWh9&>ju9&X&&$ډFVRP9&69&6$P P%PvvvvvW%PvW9&6&69&6&6 :&6&6#%PvvvvvWB:&6&6:&6&6:&6&60%PvvvvvW=%PvWD:&&&(0T|RPE%PvvvvvWvW"9&$PP ]	F  pP 	FVv~vvO%PvV
vV"PvVj!	F P Q\%QJ]	 PvV"PvVJ]	 PvvvJ]	F  ~ ~;~v^^ ؋Ǌ*3QǊ*&3ZF;v|։~v]	v_%PvV
 PvV"PvVJ]	FF= v P 	FVvv` 	t 2PP ]	
:&uvv` 	t|]	u	t 	3P(	-* ui%PvV
vV2ui6`#6^#vVFuN6p#6n#vvFt  ~9&X&&e%PFPWƋFv 2PP ]	9&X& & V\2PP ]	
:&u9&X& & ˎ9&X&&k%PFPVǋFvW	3^_]UWVF ǆP  Ɔ{ ǆ8o%:ǆ<w%>ǆ@~%BǆD%FǆH%J+NL9&
&
vx~prt89
+&G&n9&9ptH9&9vt= PP9&6&6` %P9&6&6Z T 
%P|	T:& P 	FVpP 	FV+FF{{<vv~ uZ6`#6^#%P~V P~V"P~VJ]	O Box 358, Accord
      Station, Hingham, MA 02018-0358. 

   3. Proceedings of the biannual ACM Lisp and Functional Programming
      Conference. (First one was in 1980.)

   4. Proceedings of the annual Lisp Users and Vendors Conference.

See also the Scheme Bibliography from the Scheme Repository
(nexus.yorku.ca:pub/scheme/) for additional readings. A large number
of technical reports on Scheme are now available in the text section
(scheme/txt/).

----------------------------------------------------------------
Subject: [1-4] Where can I learn about implementing Scheme interpreters  
               and compilers?

There is no single book that is really comprehensive, so you will have
to combine reading the sources to the various free implementations
(e.g., Gambit [Feeley] and S48 [Rees]) with bits and pieces of tech
reports and various books.

Books about Scheme implementation include:

   1. John Allen
      "Anatomy of Lisp"
      McGraw-Hill, 1978. 446 pages. ISBN 0-07-001115-X  (let loop ((counter n)
                  (accumulator 1))
            (if (< counter 2)
                accumulator
              (loop (- counter 1)
                    (* accumulator counter))))))

Some Schemes allow one to use the syntax (define (fact n) ...) instead
of (define fact (lambda (n) ...)).

----------------------------------------------------------------
Subject: [1-3] What documentation is available on Scheme? 
               How can I learn Scheme?

Introductions to Scheme:

   The following four books from MIT Press are listed in order of
   increasing difficulty. The first is good for the complete novice,
   the second for students with little or no previous exposure to programming,
   and the third and fourth for more advanced students. The third and
   fourth may also be used to learn a variety of powerful programming
   language concepts. One of these books will suit your needs.

   1. Daniel P. Friedman and M. Felleisen.
      "The Little LISPer"
      MIT Press (Cambridge, MA), 3rd printing, 1989. ISBN 0-262-56038-0.
      Science Research Associates (Chicago), 3rd ed, 1989. 206 pages.

      Good for a quick introduction. Uses Scheme instead of Common Lisp.
      (The book uses a dialect of Scheme with footnotes about translating to
      Scheme or Common Lisp. The footnotes won't allow a non-expert to use
      Common Lisp for the advanced chapters because of the complexity.)

   2. Brian Harvey and Matthew Wright
      "Simply Scheme: Introducing Computer Science"
      MIT Press, Cambridge, MA, 1994. 583 pages. 
      ISBN 0-262-08226-8. $49.95.

      This book is ideal for students with little or no previous exposure to
      programming. The book is designed to be used before SICP (the authors
      call it a SICP "prequel"), and makes Scheme fun by sheltering the
      students from potentially confusing technical details. Unlike Pascal
      or C, the emphasis is on ideas, not obscure matters of syntax and
      arbitrary rules of style.  High schools who have shied away from using
      Scheme because they found SICP to be too challenging should consider
      using this book instead.

      The text gradually and gently introduces students to some of the key
      concepts of programming in Scheme. It starts off with functions and
      function composition and continues with the notion of functions as
      data (first-class functions) and programs that write programs
      (higher-order functions).  Since the complexity of the language is
      hidden, students can get involved in some of the more interesting and
      fun aspects of the language earlier than in other texts.  Then the
      book progresses through the more complicated concepts of lambda,
      recursion, data abstraction and procedural abstraction, and concludes
      with sequential techniques, but with careful attention to topics
      students often find difficult.  There are five chapters on recursion
      alone! There's also a pitfalls section at the end of most chapters to
      help students recognize and avoid common errors.

      The book uses several programs as examples, including a tic-tac-toe
      program, a pattern matcher, a miniature spreadsheet, and a simple
      database program.  Source code for the programs is available by
      anonymous ftp from anarres.cs.berkeley.edu:pub/scheme/, or for $10 on
      IBM or Macintosh diskettes from the publisher.

   3. Harold Abelson and Gerald Jay Sussman, with Julie Sussman.
      "Structure and Interpretation of Computer Programs"
      MIT Press (Cambridge, MA) and McGraw-Hill (New York), 1985.
      542 pages. ISBN 0-262-01077-1. The teacher's manual, which is
      also available from MIT Press, does NOT contain solutions to the
      exercises, but does contain hints on teaching with the book.

      Starts off introductory, but rapidly gets into powerful
      Lisp-particular constructs, such as using closures and engines,
      building interpreters, compilers and object-oriented systems.  Often
      referred to by its acronym, SICP, which is pronounced "Sick-Pee". This
      is the classical text for teaching program design using Scheme,
      and everybody should read it at least once. MIT problem sets are
      available from the repositories, and materials from Gustavus
      Adolphus College are available from ftp.gac.edu:pub/SICP/. 

   4. George Springer and Daniel P. Friedman
      "Scheme and the Art of Programming" 
      MIT Press and McGraw Hill, 1990, 596 pages.

      Introduces basic concepts of programming in Scheme. Also deals with
      object oriented programming, co-routining, continuations.  Gives
      numerous examples. Has more of an emphasis on teaching Scheme than
      SICP, and can be seen as an alternative to SICP.  Source code from the
      chapters is available from the nexus.yorku.ca repository in
      pub/scheme/lit/sap/.

Older Introductions to Scheme:

   1. Smith, Jerry D.
      "Introduction to Scheme"
       Prentice Hall (Englewood Cliffs, NJ), 1988, 324 pages.
           Focuses on PC Scheme.

   2. Michael Eisenberg 
      "Programming in Scheme"
      Scientific Press (Redwood City, CA), 1988. 304 pages.

   3. Two articles in BYTE Magazine, February 1988, by Abelson and
      Sussman, and Clinger.

Online Introductions to Scheme:

   1. The Ken Dickey article, "The Scheme Programming Language", in
      COMPUTER LANGUAGES magazine, June 1992, is available from the
      Scheme Repository at nexus.yorku.ca:/pub/scheme/txt/intro.txt
      The Revised^4 Report on the Algorithmic Language Scheme is also 
      available from the Scheme Repository.

   2. The Info files from the MIT Scheme implementation.

   3. "Introductory Scheme" by Joseph W. Lavinus and James D. Arthur,
       <lavinus@virginia.edu>. Available from the Lisp Utilities
       Repository as ftp.cs.cmu.edu:user/ai/lang/scheme/doc/intro/ 
       as schemedoc.tar.gz.

Scheme and Artificial Intelligence:

   1. Wolfgang Kreutzer and Bruce McKenzie
      "Programming for Artificial Intelligence: 
       Methods, Tools and Applications"
      Addison-Wesley (Reading, MA), 1990. 682 pages. 
      ISBN 0-201-41621-2.
           Discusses Scheme, Prolog, and Smalltalk, gives an overview of
           the history and philosophy of AI, surveys three major
           programming paradigms (procedural, declarative, and
           object-oriented), and metaphors to AI programming.
           Source code from the chapters is available from
           nexus.yorku.ca in pub/scheme/lit/ as aibook.tar.Z. Some of
           the programs will only run under MacScheme.

General Scheme reference books include:

   1. K. Dybvig
      "The Scheme programming language"
      Prentice Hall, 1987.
         Good reference for Scheme.

Scheme-related periodicals include:
        
   1. LISP Pointers.
      Published by ACM SIGPLAN six times a year. Volume 1, Number 1
      was April-May 1987. 
      Subscriptions: ACM Members $12; ACM Student Members $7; Non-ACM
      members $25. Mail checks payable to the ACM to ACM Inc., PO Box
      12115, Church Street Station, New York, NY 10249.

   2. LISP and Symbolic Computation, Kluwer Academic Press. Volume 1
      was published in 1989. (jlz@lucid.com is the editor).  ISSN 0892-4635.
      Subscriptions: Institutions $169; Individuals $80. Add $8 for
      air mail. Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, 
      The Netherlands, or Kluwer Academic Publishers, Pthe Scheme Repository as /pub/scheme/scm/scoops.sha.

MEROON is a package written in Scheme to provide the basic facilities
of an object-oriented programming style through three macros:
define-class, define-generic, and define-method. MEROON offers simple
inheritance, reflective metaclasses and simple dispatching generic
functions with support for multimethods. MEROON also offers indexed
fields subsuming Scheme vectors without inheritance restrictions.
Meroon runs in Scheme->C, PC-Scheme, Chez Scheme, Elk, Bigloo, SCM
with SLIB, and MacGambit. MEROON sources and documentation may be
found in the Scheme Repository as
   nexus.yorku.ca:pub/scheme/new/meroon.*.tar.Z
and also from
   ftp.inria.fr:pub/INRIA/icsla/Programs/MeroonV3*.tar.gz [128.93.1.26]
The file meroonet*.tar.gz is a toy version of meroon. For more
information, contact Christian Queinnec <queinnec@polytechnnique.fr>
or <Christian.Queinnec@inria.fr>.

YASOS (Yet Another Scheme Object System) is fairly functional in style
and uses delegation.  The implementation includes multiple inheritance
and "send to super" and is much smaller than class-based OO systems.
See Ken Dickey, "Scheming with Objects", AI Expert 7(10):24-33,
October 1992. A copy of the article and YASOS code is available from
the Scheme Repository in /pub/scheme/txt/swob.txt. YASOS is also
included as part of SLIB. For further information, contact Ken Dickey
<kend@newton.apple.com>.

Tiny CLOS is a Scheme implementation of a `kernelized' CLOS, with a
metaobject protocol. The implementation is even simpler than the
simple CLOS found in `The Art of the Metaobject Protocol,' weighing in
at around 850 lines of code, including (some) comments and
documentation. Tiny CLOS is available by anonymous ftp from
parcftp.xerox.com:/pub/mops/. Tiny CLOS runs in MIT Scheme 11.74 and
should run with only minor modifications in other Schemes as well. If
you want to be added to the mops@parc.xerox.com mailing list
(technical questions and discussion only), send mail to Gregor Kiczales
<gregor@parc.xerox.com>.

----------------------------------------------------------------
Subject: [1-9] Repositories of Scheme Software

There are several repositories of publicly redistributable and
public domain Scheme code. 

   The Scheme Repository contains a Scheme bibliography, copies of the
   R4RS report, IEEE P1178 specification and other papers, sample Scheme
   code for a variety of purposes, several utilities, and some
   implementations. The Scheme code includes code for calendar
   calculations, Earley parser, FORMAT for Scheme, a scheme version of
   the Gabriel benchmarks, Marc Feeley's minimal object support for
   Scheme, a Scheme pretty-printer, a Prolog interpreter written in
   Scheme, a random number generator in Scheme, an implementation of
   SCOOPS, code from Abelson and Sussman's SICP book, Aubrey Jaffer's
   IEEE/R^3.99RS compliance test, an implementation of matrices, a Scheme
   implementation of the Common Lisp FORMAT function, a Scheme front
   end to Adobe Illustrator PostScript, and a LALR(1) parser (ZEBU).
   The repository is maintained by Ozan S. Yigit, <scheme@nexus.yorku.ca>.
   The repository is accessible by anonymous ftp at nexus.yorku.ca
   [130.63.9.66] in the directory pub/scheme/. The repository is
   mirrored in INRIA, courtesy of Christian Queinnec [Ecole Polytechnique
   and INRIA-Rocquencourt], ftp.inria.fr:lang/Scheme.

   Scheme Implementations may also be found at altdorf.ai.mit.edu:/archive/ 
   The R4RS report is available in altdorf.ai.mit.edu:/archive/scheme-reports/
   or as MIT AI Memo 848b (email publications@ai.mit.edu for more information).
   The altdorf archive includes SCOOPS, CL2Scheme, extend-syntax,
   btree, Gabriel benchmarks, FORMAT for Scheme, etc.

   The GI (German Computer Science Society) Scheme Archive contains a
   variety of scheme programs, utilities, code from theses, and other
   materials. It also mirrors the Nexus Scheme Repository.  It is
   accessible by anonymous ftp to faui80.informatik.uni-erlangen.de
   (login as 'ftp', giving your email address as the password).
      pub/scheme/gi                # GI Scheme Archive
      pub/scheme/yorku             # Internet Scheme Repository
   Direct questions to scheme@faui80.informatik.uni-erlangen.de.
   The GI Scheme Archive is supported by the German Computer Society Special
   Interest Group on AI programming and sponsored by the Bavarian AI Center
   FORWISS -- Research Institute for Knowledge Based Systems.

----------------------------------------------------------------
Subject: [1-10] Publicly Redistributable Scheme Software

   SLIB (Standard Scheme Library) is a portable scheme library that
   provides compatibility and utility functions for many of the
   standard scheme implementations, including Chez, ELK 2.1, GAMBIT,
   MITScheme, scheme->C, Scheme48, T3.1, VSCM and Scm4e. It is available by
   anonymous ftp from 
       altdorf.ai.mit.edu:archive/scm/slib2a0.tar.gz
       prep.ai.mit.edu:pub/gnu/jacal/slib2a0.tar.gz
       nexus.yorku.ca:pub/scheme/new/slib2a0.tar.gz

   TEST.SCM is an IEEE and R4RS conformance test suite.  It is available
   from 
      altdorf.ai.mit.edu:archive/scm/test.scm
      prep.ai.mit.edu:pub/gnu/jacal/test.scm
      nexus.yorku.ca:pub/scheme/new/test.scm

   PSD (Portable Scheme Debugger) is available by anonymous ftp
   from Tampere University of Technology, Finland,
      cs.tut.fi:/pub/src/languages/schemes/psd-1.1.tar.Z
   With PSD, you can run a Scheme program in an Emacs buffer, set
   breakpoints, single step evaluation and access and modify the
   program's variables. It works by instrumenting the original source
   code, so it should run with any R4RS compliant Scheme. It has been
   tested with SCM and Elk 1.5, but should work with other Schemes with a
   minimal amount of porting, if at all. Includes documentation and
   user's manual. Written by Pertti Kellom\"aki, pk@cs.tut.fi

   SCLINT is a lint-like program for Scheme. It checks for consistency of
   indentation, syntax of special forms, and the number of arguments to
   primitive and most user-defined procedures. This is not a full
   implementation, but rather a quick hack. It is used in teaching
   programming at the Tampere University of Technology. It is available
   by anonymous ftp from cs.tut.fi:/pub/src/languages/schemes/sclint-0.9.tar.Z.
   For further information, write to Pertti Kellom\"aki <pk@cs.tut.fi>.

   A bibliography of work in functional programming can be obtained by 
   anonymous ftp from tamdhu.dcs.st-andrews.ac.uk:/pub/staple/pubs.txt
   (138.251.192.40). It uses a refer-like format with %T for title, %A
   for authors %I for a unique index entry %S for source (possibly a
   reference to another index) %K for keywords and %C for comments.
   Compiled by Tony Davie, <ajtd@honey.st-and.ac.uk>. [Email bounced, 7/7/93.]

   Scheme Utilities -- brokaw.lcs.mit.edu:/pub/scmutils.tar  18.30.0.33
   [This collection seems to no longer be located on brokaw -- does
   anybody know the current location?]

   A collection of Scheme implementations of data structures and
   algorithms is available by anonymous ftp from cs.tut.fi in the
   directory /pub/src/languages/schemes/ as the file scheme-algorithms.tar.
   For more information, contact Pertti Kellom\"aki <pk@cs.tut.fi>.

   6.001. The User's Manual, example code, and problem sets from MIT's
   course "Structure and Interpretation of Computer Programs" are 
   available by anonymous ftp from martigny.ai.mit.edu:archive/6.001/
   [18.43.0.152].

   Steele's Constraint System. Chris Hanson's implementation of Steele's
   constraint system is available for anonymous ftp from
      martigny.ai.mit.edu:archive/cph/constraint.tar [18.43.0.152]
      nexus.yorku.ca:pub/scheme/new/constraint.tar.Z
   A compressed version is also stored there. The software is source code
   for MIT Scheme. It should run in release 7.1.3. Most of the MIT Scheme
   dependencies could be eliminated, but it also uses the following
   procedures which aren't in standard Scheme: error, bkpt, macros,
   dynamic binding, and string output ports. The code corresponds pretty
   closely to Guy Steele's PhD thesis implementation, which you can
   obtain in printed form from the MIT AI Lab publications office as
   AI-TR-595 for $15.00 (email publications@ai.mit.edu for more
   information). For more information, send email to Chris Hanson
   <cph@martigny.ai.mit.edu>.

   JACAL is a symbolic mathematics system for the simplification and
   manipulation of equations and single and multiple valued algebraic
   expressions constructed of numbers, variables, radicals, and algebraic
   functions, differential, and holonomic functions. In addition, vectors
   and matrices of the above objects are included.  JACAL is written in
   Scheme and requires SLIB. JACAL source is available via anonymous FTP
   from
      altdorf.ai.mit.edu:archive/scm/jacal1a0.tar.Z,
      prep.ai.mit.edu:pub/gnu/jacal/jacal1a0.tar.Z, and
      nexus.yorku.ca:pub/scheme/new/jacal1a0.tar.Z
   Contact jaffer@altdorf.ai.mit.edu for more information.
  
   Zebu 0.9 is an LALR(1) parser generator for Scheme written by 
   William M. Wells III. It lives in the Scheme Repository nexus.yorku.ca
   in the scm directory and works with PC-Scheme from TI and MIT C-Scheme 6.2
   (but not with anything after 7.0).

   Thomas is a compiler for the Dylan programming language.  The Thomas
   system is written in Scheme and runs under MIT's CScheme, DEC's
   Scheme->C, and Marc Feeley's Gambit.  It can run on a wide range of
   machines including the Macintosh, PC compatibles, Vax, MIPS, Alpha,
   and 680x0.  Thomas generates IEEE compatible Scheme code.  Thomas is
   available to the public by anonymous ftp at
      crl.dec.com:pub/DEC/Thomas
      gatekeeper.pa.dec.com:pub/DEC/Thomas
      altdorf.ai.mit.edu:archive/Thomas
   For more information on Thomas and Dylan, see part 4 of the Lisp FAQ.

   MATCH is a pattern matching macro package for Scheme.  Pattern
   matching allows complicated control decisions based on data structure
   to be expressed in a concise manner. This document describes several
   pattern matching macros for Scheme, and an associated mechanism for
   defining new forms of structured data. This macro package works with
   any Scheme that supports defmacro (which is obtainable by loading
   SLIB), such as Chez Scheme (release 4 or greater). MATCH is available
   by anonymous ftp from titan.cs.rice.edu:public/wright/match.tar.Z
   [128.42.1.30] and includes the macro source code and documentation. A
   copy should be available from the Scheme repository shortly.  For
   further information, write to Andrew Wright, <wright@cs.rice.edu>.

   STk is a graphical package which relies on Tk and the Scheme
   programming language. It is similar to Ousterhout's Tk package but
   with the Tcl language replaced with Scheme. Mostly R4RS compliant.
   (Some number procedures are not implemented, over-simplified call/cc,
   symbol case is significative.) All of the commands defined by the Tk
   toolkit are available to the STk interpreter, and Tk variables are
   reflected back into Scheme as Scheme variables. Callback is expressed
   in Scheme. Includes a CLOS-like OO extensions.  A set of classes have
   been defined to manipulate Tk commands (menu, buttons, scales, canvas,
   canvas items) as Scheme objects. STk runs on Sparc (SUNOS 4.1.x),
   Dec 5xxx (Ultrix 4.2), SGI (Irix 4.05, 5.1.1), and DEC Alpha. STk
   is available by anonymous ftp from 
      kaolin.unice.fr:/pub/STk-2.0.tar.gz [193.48.229.225]
   Please send bug reports, comments, and questions to Erick Gallesio,
   <eg@unice.fr>, Universite de Nice - Sophia Antipolis, I3S,   CNRS -
   URA 1376 - Bat 4, 250, avenue Albert Einstein, 06560 Valbonne -
   Sophia Antipolis, phone (33) 92-94-26-04, fax (33) 92-94-28-98.

----------------------------------------------------------------
Subject: [1-11] Formatting code in LaTeX

SLaTeX is a R4RS-compliant Scheme program that allows you to write
program code "as is" in your LaTeX or TeX source.  It is particularly
geared to the programming languages Scheme and Common Lisp, and has
been tested in Chez Scheme, Common Lisp, MIT C Scheme, Elk, Scheme->C,
SCM and UMB Scheme on Unix; and MIT C Scheme and SCM on MSDOS.  The
formatting of the code includes assigning appropriate fonts to the
various tokens in the code (keywords, variables, constants, data), at
the same time retaining the proper indentation when going to the
non-monospace (non-typewriter) provided by TeX.  SLaTeX comes with two
databases that recognize the standard keywords/variables/constants of
Scheme and Common Lisp respectively.  These can be modified by the
user using easy TeX commands.  In addition, the user can inform SLaTeX
to typeset arbitrary identifiers as specially suited TeX expressions
(i.e., beyond just fonting them).  The code-typesetting program SLaTeX
is available by anonymous ftp from cs.rice.edu as the file
public/dorai/slatex.tar.Z. Send bug reports to dorai@cs.rice.edu.

SchemeWEB 2.0 is a Unix filter that translates SchemeWEB source into LaTeX
source or Scheme source.  Originally developed for the Scheme dialect
of Lisp, it can easily be used with most other dialects.
Available by anonymous ftp from
   nexus.yorku.ca:/pub/scheme/new/schemeweb.sh
For more information, contact John D. Ramsdell <ramsdell@mitre.org>.

The Literate Programming FAQ lists a number of alternatives, both
language-independent and Scheme-specific. The Literate Programming FAQ
is posted once a quarter to the comp.literate.programming newsgroup
and is available by anonymous ftp from rtfm.mit.edu. A copy may also be
requested by sending an email message to fileserv@shsu.edu
   sendme litprog.faq
in the body of the message.

----------------------------------------------------------------
Subject: [1-12] Where can I get an implementation of Prolog in Scheme?

   Prolog in Scheme is a collection of macros that expand syntax for
   clauses, elations, and so on. It is written in Scheme and has support
   for delayed goals and interval arithmetic. It is known to run in Chez
   Scheme and in Elk, and is intended to be portable to other Scheme
   implementations. It relies on continuations, and so is not easily
   ported to Common Lisp. Available from the University of Calgary by
   anonymous ftp from
      ftp.cpsc.ucalgary.ca:pub/prolog1.2/prolog12.tar.Z
   Questions and comments may be addressed to Alan Dewar
   <dewar@cpsc.ucalgary.ca> or John Cleary <jcleary@waikato.ac.nz>.

   Schelog is an embedding of Prolog in Scheme. It represents Prolog
   goals as procedures in Scheme, and includes macros to simulate a
   Prolog-style syntax for clauses, relations and queries.  The embedding
   permits the user to combine Prolog and Scheme code freely, in the same
   s-expression, if desired.  Documentation and examples are included.
   Schelog should run in any R4RS Scheme, has been tested in SCM and Chez
   Scheme, and will run in any Scheme implementation that supports SLIB (see
   entry in [1-10] above).  Schelog (version 2) is available by anonymous
   ftp from titan.cs.rice.edu:public/dorai/schelog2.tar.Z.  Its use of
   higher-order continuations is probably a major obstacle to porting it
   to Common Lisp.  For more information, please contact the author Dorai
   Sitaram <dorai@cs.rice.edu>.

----------------------------------------------------------------
Subject: [1-13]  What does SICP, SCOOPS, R4RS, CAR, CDR, ... mean?

Glossary of acronyms:
   CAR             Originally meant "Contents of Address portion of Register",
                   which is what CAR actually did on the IBM 704.
   CDR             Originally meant "Contents of Decrement portion of 
                   Register", which is what CDR actually did
                   on the IBM 704. Pronounced "Cudder".
   ANSI            American National Standards Institute
   SICP            Abelson and Sussman's book "Structure and
                   Interpretation of Computer Programs".
   EOPL            Essentials of Programming Languages 
   SCOOPS          An experimental object-oriented programming
                   language for Scheme.
   R3RS            Revised^3 Report on the Algorithmic Language Scheme.
   R4RS            Revised^4 Report on the Algorithmic Language Scheme.

----------------------------------------------------------------
Subject: [1-14] Why is there no EVAL in Scheme?

The answer to this question is based on information provided by 
Guillermo J. Rozas and Aubrey Jaffer.

There are three major positions in the Scheme community regarding EVAL:

   1. No EVAL: EVAL is antithetical to a Pascal-like (compiler based,
      externally statically linked) implementation for Scheme, such as
      some people have or wish to see. 

   2. Single Argument: There is a single distinguished top-level
      environment, and EVAL always evaluates its argument there. 
      (This is the approach taken in Common Lisp, where EVAL evaluates
      its argument in the current dynamic environment and in a null
      lexical environment.) 

   3. Two Arguments: There are multiple environments in which
      the user might want to evaluate expressions, so EVAL should take
      two arguments, the second being an environment.  In particular,
      in some systems with first-class environments, there is no
      a-priori single distinguished top-level environment, and
      defaulting the environment does not fit those dialects well.

Not every dialect of Scheme has EVAL. Most do, but some with different
names and arguments. Jaffer's SLIB package uses LOAD as defined in
R4RS to define EVAL for those implementations that don't support EVAL
(e.g., by writing the code out to a file and then loading it).
Rozas's compromise proposal for EVAL was accepted for R5RS, but it is
unclear whether there will ever be a R5RS.

----------------------------------------------------------------
;;; *EOF*
