Go to the first, previous, next, last section, table of contents.

Concept Index

'

  • '()

    • (

  • ()

    • =

  • = (standard Scheme procedure)

    • a

  • actual parameter
  • anonymous procedure
  • append (standard Scheme procedure)
  • append (std. Scheme procedure), brief introduction
  • apply (standard Scheme procedure)
  • argument
  • argument variable
  • arguments, variable number of
  • assoc, assq, and assv (standard Scheme procedures)
  • association
  • association list

    • b

  • binding contour
  • binding environment
  • bindings vs. values
  • block structure diagrams for lets
  • boolean
  • bootstrapping

    • c

  • cadr (standard Scheme procedure)
  • car (field of pair)
  • cddr (standard Scheme procedure)
  • cdr (field of pair)
  • combination
  • compose
  • composition, procedure
  • control structures
  • copying
  • cross-compiling
  • currying

    • d

  • deep copy
  • dynamic scoping

    • e

  • empty list, the
  • eq?, equal?, and eqv? (standard Scheme procedures)
  • equality predicates
  • equality predicates, choosing
  • evaluation of nested expressions
  • exiting Scheme

    • f

  • first class
  • for-each (standard Scheme procedure)
  • formal parameter

    • g

  • garbage collection

    • h

  • higher-order procedure

    • i

  • identifier
  • identifiers vs. variables
  • if expressions
  • immediate values
  • immutability of numbers
  • improper list
  • indefinite extent
  • indenting
  • infinite loops, breaking out of
  • infinite recursion, breaking out of
  • interactive programming environment
  • interrupting Scheme

    • l

  • lambda (special form)
  • length (standard Scheme procedure)
  • length (std Scheme procedure), brief introduction
  • let
  • let* (special form)
  • letrec (special form)
  • lexical analysis
  • lexical scope
  • lexical scope and let
  • list (data structure)
  • list (std. Scheme procedure), brief introduction
  • list membership
  • list, heterogeneous
  • list-ref
  • list-tail
  • lists, copying
  • lists, quoting
  • literals
  • local defines
  • local procedures
  • local variables

    • m

  • macro
  • map (standard Scheme procedure)
  • math-eval (simple example expression evaluator)
  • member (std. Scheme procedure), brief introduction
  • member, memq, and memv (standard Scheme procedures)

    • n

  • null pointer

    • o

  • object identity
  • object representation
  • operators are procedures

    • p

  • pair (standard Scheme data type)
  • pair-tree-sum
  • parentheses
  • parser, reader as simple one
  • pointers
  • predicates
  • procedure
  • procedure composition
  • procedure specialization
  • procedure, anonymous
  • procedure, first class
  • procedure, higher-order
  • procedures, local
  • proper list

    • q

  • quitting Scheme
  • quoting and literals
  • quoting lists

    • r

  • read, example implementation
  • read-eval-print loop
  • read-token (simple example lexical analyzer)
  • reader
  • recovering from mistakes
  • rest lists
  • RETURN and ENTER keys
  • return values
  • reverse (standard Scheme procedure)
  • reverse (std. Scheme procedure), brief introduction

    • s

  • s-expression (data structure)
  • scanning (lexical analysis)
  • self-evaluation
  • self-evaluation, implementation in interpreter
  • shallow copy
  • side effects
  • side effects, cons doesn't have any
  • snarfing
  • special forms
  • string (data type)
  • structural equivalence
  • symbol (data type)
  • syntactic sugar
  • system hangs

    • t

  • tail call
  • tail recursion
  • truth
  • type predicates

    • v

  • value cells
  • values
  • variable arity
  • variables vs. bindings

    • Go to the first, previous, next, last section, table of contents.