Sketchy LISP

An Introduction to Functional Programming in Scheme

Index

#

#f

#t

#\newline

#\space

' [2]

()

* [2] [3]

+ [2] [3]

, [2]

,@ [2]

->

- [2]

/

...

<

<=

=

=>

>

>=

` [2]

A

alist

alpha conversion

and [2] [3]

append

applicative language

applicative order

apply [2]

argument

assoc

association list

assq

assv

atom

B

begin [2] [3]

beta reduction

bignum arithmetics [2]

binding [2] [3]

boolean

bottom [2]

bottom

bound variable

box notation

boxed value

C

caar...cddddr

cadr

call by name [2]

call by value [2]

call/cc

call-with-current-continuation

car [2]

case [2]

case insensitive

cdr [2]

character predicate

char>?

char<=?

char-alphabetic?

char-downcase

char-lower-case?

char-numeric?

char-upcase

char-upper-case?

char-whitespace?

character

clause [2]

close over

closure

code

combinator

comment

cond [2] [3] [4]

cons [2]

cons object [2]

continuation

current continuation

currying

D

default input port

define [2]

define-syntax [2]

disjointness of types

display [2]

dotted pair

dynamic context

dynamic scoping

dynamic typing

E

effect (of a function)

ellipsis

else (of cond)

empty list [2]

EOF object

eof-object?

eq? [2] [3]

equal?

equality [2]

eqv?

eta conversion

evaluation

expression

external representation [2]

F

file

first class object

fixed point

floor

free variable

freelist

full numeric tower

function

function body [2]

G

garbage collection

gcd

H

head (of a list)

head (of a procedure)

higher order function

I

identity [2]

identity function

if [2] [3]

imperative programming

improper list

indefinite extent

indirect recursion

inner context

integer

K

keyword

L

lambda [2] [3] [4]

lambda calculus [2]

lcm

length

let* [2] [3]

let [2] [3] [4]

letrec [2] [3] [4] [5] [6]

lexical environment

lexical scoping

LISP

list

list->string

list

list-ref

list?

M

map

max

member

memory compaction

memory fragmentation

memq

memv

metaprogramming

modulo

mutual recursion [2]

N

negative?

newline

non-local exit

normal form

normal order

not

null?

number?

numeric predicate

numeric tower

O

or [2] [3]

order of evaluation [2]

outer context

P

pair

pair?

pattern

permutation

port

predicate

predicate (of cond)

primitive function

procedure

procedure application [2]

pseudo function [2]

Q

quasiquote [2]

quine

quotation [2] [3]

quote [2]

quotient [2]

R

rational value

read-char

read eval print loop

read [2]

recursion [2]

reduction

remainder

S

self-application [2]

set!

side effect [2] [3]

signature

spine

sqrt

strict function

string->list

string->symbol

string-ci<?

string-ci=?

string

string-length

string predicate

string-ref [2]

string=?

string

style

substring

symbol

symbol->string

syntax [2]

syntax-rules [2]

syntax transformation

T

tail (of a list)

tail call

tail call optimization [2]

tail recursive [2]

truth value

type checking

type conversion

type predicate

U

unquote [2]

unquote-splicing [2]

unspecific value

V

value

variable

variadic procedure

W

with-input-from-file

with-output-to-file

write [2]

Y

Y combinator

Z

zero?