Simply Scheme: Introducing Computer Science 2/e Copyright (C) 1999 MIT

Table of Scheme Primitives by Category

cover photo
Brian Harvey
University of California, Berkeley
Matthew Wright
University of California, Santa Barbara

Download PDF version
Back to Table of Contents
BACK chapter thread [no next]
MIT Press web page for Simply Scheme

Use this table if you've forgotten the name of a primitive. Then look in the index to find more about how to use the primitive.

* Not part of standard Scheme

Words and Sentences

appearances*
before?
*
butfirst (bf)
*
butlast (bl)
*
count
*
empty?
*
equal?
*
first
*
item
*
last
*
member?
*
quote
sentence (se)
*
sentence?
*
word
*
word?
*

Lists

append
assoc
car
cdr
c...r
cons
filter
*
for-each
length
list
list?
list-ref
map
member
null?
reduce
*

Trees

children*
datum
*
make-node
*

Arithmetic

+, -, *, /
<, <=, =, >, >=
abs
ceiling
cos
even?
expt
floor
integer?
log
max
min
number?
odd?
quotient
random
remainder
round
sin
sqrt

True and False

and
boolean?
cond
if
not
or

Variables

define
let

Vectors

list->vector
make-vector
vector
vector?
vector-length
vector->list
vector-ref
vector-set!

Procedures

apply
lambda
procedure?

Higher-OrderProcedures

accumulate*
every
*
filter
*
for-each
keep
*
map
reduce
*
repeated
*

Control

begin
error
load
trace
untrace

Input/Output

align*
display
newline
read
read-line
*
read-string
*
show
*
show-line
*
write

Files and Ports

close-all-ports*
close-input-port
close-output-port
eof-object?
open-input-file
open-output-file

* Not part of standard Scheme


(back to Table of Contents)

BACK chapter thread [no next]

Brian Harvey, bh@cs.berkeley.edu