COMMENT ⊗   VALID 00005 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.DEVICE XGP
C00008 00003	.<< Pub macros for making CS206 handouts >>
C00011 00004	.sname ←ssname ←null
C00014 00005	.NEXT PAGE
C00021 ENDMK
C⊗;
.DEVICE XGP;
.PAGE FRAME 54 HIGH 80 WIDE;
.evenleftborder ← oddleftborder ← 1000;
.area text lines 4 to 54;
.title area heading lines 1 to 3
.place text;
.sname←null;
.every heading(, {sname}, {page}) ;
.
.TURN ON "α%"; turn on "_" for "#" ;
.FONT 1 "BAXL30";
.<< Pub macros for making CS206 handouts >>
.
.MACRO  hd206 (TERM) ⊂
.BEGIN    NOFILL  TURNON "←→"
←COMPUTER SCIENCE DEPARTMENT
←STANFORD UNIVERSITY
.SKIP  2
CS206  ←COMPUTING WITH SYMBOLIC EXPRESSIONS  →TERM
.TURNOFF
.END ⊃
.
.
.
.MACRO fact  ⊂  
.   MACRO instr (NAME , OFFICEandPHONE , OFFICE_HOURS) ⊂
.	BEGIN  TURNON "∂" NOFILL
Instructor:∂(16)NAME
∂(4)Office:∂(16)OFFICEandPHONE
    Hours:∂(16)OFFICE_HOURS
.	TURNOFF
.	END ⊃
.
.
.   MACRO ta (NAME , OFFICEandPHONE , OFFICE_HOURS) ⊂
.	BEGIN TURNON "∂"  NOFILL
TA:	∂(16)NAME
∂(4)Office:∂(16)OFFICEandPHONE
∂(4)Hours:∂(16)OFFICE_HOURS
.	TURNOFF
.	END ⊃
.
.
.   MACRO meet (WHEN , WHERE) ⊂
.	BEGIN TURNON "∂"  NOFILL
Course Meets:∂(16)WHEN
	     ∂(16)WHERE
.	TURNOFF
.	END ⊃
.
.
.   MACRO work (MUMBLE) ⊂
.	BEGIN FILL INDENT 0 , 8
Course Work:   
MUMBLE
.	END ⊃
.
.
.   MACRO books (T) ⊂
.	BEGIN NOFILL TURNON "∂{}"
.FOO ← "T"
.BAZ ← SCAN(FOO,"@","","IS")
Texts:∂(16){BAZ}
.    REPEAT   ⊂IF FOO=NULL THEN DONE ELSE BAZ ← SCAN(FOO,"@","", "IS");
      ∂(16){BAZ}
. ⊃
.
.	TURNOFF
.	END ⊃
.
.
.    MACRO comp (MUMBLE) ⊂
.	BEGIN FILL INDENT 0,8
Computer:  
MUMBLE
.	END ⊃
.
.BEGIN TURNON "←"
.SKIP
←COURSE FACTS
.SKIP
.TURNOFF
.END 
.  ⊃
.sname ←ssname ←null
.PORTION MAINPORTION
.NEXT PAGE
.<<NB!!!! Should be SPRING 1979>>
.hd206 SPRING 1979
.
.fact
.SKIP
.instr Douglas Lenat, | Serra House (497-4878) or AI Lab (497-4971)|,
.|Fri 3-5 in Serra House before May 1, Margaret Jacks Hall after May 1.|
.SKIP
.SKIP
.ta Russ Greiner, |Serra House (497-4878) or AI Lab (497-4971)|,|Thu 3-5 (Serra, then
.Margaret Jacks Hall).|
.SKIP
.SKIP
.
.meet |T,Th 11:00-12:15|,|Room 370 (outer quad)|
.SKIP
.SKIP
.
.books |McCarthy and Talcott, LISP (from Marion Hazen, Serra House)@
.MACLISP Manual (to appear in bookstore)@
.LISP on LOTS Mini-manual (handout)@
.Winston, Artificial Intelligence (Optional)@
.Weissman, Clark, LISP 1.5 Primer (Very Optional)|
.SKIP
.SKIP
.
.work |	 This course consists of lectures, 
.homework (which counts 50 points), a midterm examination (20 points),
.a final examination (20 points), and an optional term project (20 points). 
.Projects will be 
.due on the  day of the final  examination.  It is possible to get a 
.grade of B or Pass in the course without doing a  project, and the 
.grade of INC  will be given only under exceptional circumstances.  
.A handout with more complete information on the term 
.project will be out soon.|
.SKIP
.SKIP
.
.comp
.|  We will be using the LOTS computing facility.  
.It is located in the CERAS building (beyond the bookstore).  
.LOTS is open 24 hours a day.  
.To get an account, go to LOTS, obtain an "Introduction to LOTS" 
.handout and fill out the attached form.  Then find an available terminal, 
.type OPEN after getting the system's attention, and follow the 
.instructions.  Your account should be ready after one working day.  
.You can "login" as GUEST with password GUEST just to try the system out.|
.NEXT PAGE
.TURNON "←"
←COURSE REFERENCE LIST
.TURNOFF

	The following books, manuscripts, papers, reports, etc. are
available at the Computer Science Library:

    [SAILON is an abbreviation for Stanford Artificial Intelligence 
Laboratory Operating Note; AIM abbreviates Artificial Intelligence
Memo.]
.SKIP
.BEGIN PREFACE 0  INDENT 8,12

Allen, John R., "Anatomy of LISP", (manuscript on LISP and its 
implementations) McGraw-Hill, 1978.

Baumgart, Bruce G., "MICRO PLANNER Alternate Reference Manual", 
SAILON 67, 1972.

Berkeley, E.C. and D.G. Bobrow, eds., "The Programming Language LISP:
Its Operation and Applications", Information International, Inc.,
Cambridge, Mass., 1964.

Bobrow, D.G. and B. Raphael, "New Programming Languages for AI Research",
XEROX CSL-73-2, 1976.

Friedman, D.P. and D.S. Wise, "An Environment for Multiple-Valued Recursive 
Procedures", Indiana University Comp. Sci. Dept. Technical Report #40, 1975.

Friedman, D.P. and D.S. Wise, "Cons Should not Evaluate Its Arguments", 
Indiana University Comp. Sci. Dept. Technical Report #44, 1976.

Henderson, P. and J.H. Morris,  "A Lazy Evaluator",
Third ACM Symp on Principles of Programming Languages, 95-103, 1976.

Maurer, W.D., "The Programmer's Introduction to LISP", 
MacDonald / American_Elsevier, 1972.

McCarthy, John, et al, "LISP 1.5 Programmer's Guide", MIT Press, 1965.

Siklossy, L., "Let's Talk LISP",  Prentice Hall, 1976.

Smith, D.C., "MLISP", AIM 135, 1970.

Sussman, G.J. and G.L. Steele, "SCHEME, An Interpreter for Extended Lambda Calculus",
MIT-AI Memo 349, 1975.

Sussman, G.J. and G.L. Steele, "LAMBDA, The Ultimate Imperitave", 
MIT-AI Memo 353, 1976.

Steele, G.L., "LAMBDA, The Ultimate Delclaritave", MIT-AI Memo 379, 1976.

Teitelman, W., D. Bobrow, and A. Hartley, "INTERLISP Reference Manual", 
Xerox PARC, 1973.

Weissman, C., "LISP 1.5 Primer", Dickenson, Belmont, CA., 1967.
.END
.SKIP
Other publications about LISP, data structures, and other languages used in AI:
.BEGIN PREFACE 0  INDENT 8,12

Hewitt, C., "Description and Theoretical Analysis (Using Schemata)
of PLANNER", MIT-AI Technical Report 258, 1972.

London, R., "Correctness of Two Compilers for a LISP Subset", AIM-151, 1971.

McDermott, D.V. and G.J. Sussman, "The CONNIVER Reference Manual", MIT-AI
Technical Report 259,  1972.

Rulifson, J.F., J.A. Dirkson and R.J. Waldinger, "QA4: A Procedural Calculus for
Intuitive Reasoning", SRI-AIC Technical Note 73, 1972.
.END