Index

A

abstract data type ALGOL 60 (programming language)

arity (of a procedure, fixed) (of a procedure, non-fixed)

B

body (of a lambda-abstraction) (of a let*-expression) (of a let-expression) (of a letrec-expression)

C

C (programming language) call by name call by need call by value (left to right) (right to left) case-expression Chez Scheme Chez Scheme special form (time) (trace-lambda)

clause (in a case-expression) (in a cond-expression) (in a cond-expression, binding) (in a cond-expression, inconsequential) (in the header of a let*-expression) (in the header of a let-expression) (in the header of a letrec-expression) command (syntactic unit, revisited) comment cond-expression context (delimited, for call by need) copy rule (the)

D

De Morgan's laws

definiens (in a global definition) (in a let*-expression) (in a let-expression) (in a letrec-expression)

E

emacs environment (empty) (extension) (global, in Scheme) (initial, in Scheme) (local, in Scheme) (lookup) environments (abstract data type) (as association lists) (as functions) errorf

evaluation order expression (closed) (syntactic unit, revisited) expressions (arithmetic) (Boolean)

F

Feynman, Richard P. (about knowing something) fixed points

Friedman, Daniel P.

H

Haskell (programming language)

header (of a let*-expression) (of a let-expression) (of a letrec-expression)

I

idempotence (for Boolean expressions) interpreter (for Boolean expressions)

involution

L

lambda (abstraction with a trace) (abstraction with fixed arity) (abstraction with non-fixed arity) (abstraction) (dropping) (lifting) Landin's correspondence principle Landin, Peter (syntactic sugar)

Lisp list (concatenation) (the empty) lists (association) (heterogeneous) (improper) (nested) (proper) (shared)

N

nil normal form (negational)

numbers (random), [1]

O

operator (infix) (postfix) (prefix) order of evaluation for actual parameters

Orwell, George (expressiveness)

P

pair (dotted) pairs (car) (cdr) (cons) (pair?) (set-car!) (set-cdr!) parameters (actual) (formal) parser (for Boolean expressions) Perlis, Alan (low-level programming language) (the Turing tar pit)

predicate (type) procedure (identity) (identity, traced) (variadic) program transformation (Boolean expressions) programming (defensive)

Q

quick and dirty

quotation (nested) (self)

R

representation (representation of a)

S

Satori Scheme (Chez) (programming language) Scheme expression (Booleans) (characters) (numbers) (strings) Scheme special form (and) (application) (define) (define, revisited) (lambda with fixed arity) (lambda with non-fixed arity) (or) Scheme special-form (if) Schmidt, David A.

scope (dynamic) (lexical) (lexical, in Scheme) (shadowed bindings in lexical) (static) Standard ML (programming language) sugar (syntactic) symbol syntax checker (for a basic imperative language) (for Boolean expressions) (for Scheme, in Scheme) (for arithmetic expressions)

T

tests (stress)

U

unit tests (negative)

unparser (for Boolean expressions)

V

variable (bound) (free)