Fundamentals of Computer Science I (CS151 2003F)
[Skip to Body]
Primary:
[Front Door]
[Current]
[Glance]
-
[Honesty]
[Instructions]
[Links]
[Guidelines for Lab Writeups]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Outlines]
[Readings]
[Reference]
Misc:
[Scheme Report]
[Glimmer Scheme Reference]
[CSC151.01 (Gum)]
[CSC151 2003S]
[CSC151 2002F]
[SamR]
Back to An Introduction to Scheme. On to Numbers.
Held: Monday, 8 September 2003
Summary: Today we consider two of Scheme's most important types of data: symbolic values and lists.
Related Pages:
Assignments
Notes:
Overview:
> 'a a > a reference to undefined identifier: a > (quote a) a
> (define a 12) > a 12 > 'a a
Take it literally; don't attempt to interpret or evaluate it.
null or
().
(cons thing-for-the-front rest-of-the-list)
> (cons 'a null) (a) > (cons 'b (cons 'a null)) (b a)
list.
> (list 'a 'b 'c)
(a b c)
car: get the initial element of the list.
cdr: get all but the initial element of the list.
list-ref: get the ith element of the list.
Back to An Introduction to Scheme. On to Numbers.
[Skip to Body]
Primary:
[Front Door]
[Current]
[Glance]
-
[Honesty]
[Instructions]
[Links]
[Guidelines for Lab Writeups]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Outlines]
[Readings]
[Reference]
Misc:
[Scheme Report]
[Glimmer Scheme Reference]
[CSC151.01 (Gum)]
[CSC151 2003S]
[CSC151 2002F]
[SamR]
Disclaimer:
I usually create these pages on the fly
, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Tue Dec 9 13:59:33 2003.
The source to the document was last modified on Mon Sep 1 13:30:51 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2003F/Outlines/outline.07.html.
You may wish to
validate this document's HTML
;
;
Check with Bobby