Structure and Interpretation of Computer Programs

    in algebraic manipulation

    in polynomial arithmetic

    procedure

    table

Colmerauer, Alain

combination

    combination as operator of

    compound expression as operator of

    evaluation of

    

lambda

 expression as operator of

    as operator of combination

    as a tree

combination, means of, see also closure 

comma, used with backquote

comments in programs

Common Lisp

    treatment of 

nil

compacting garbage collector

compilation, see compiler 

compile

compile-and-go

, [2]

compile-and-run

compile-application

compile-assignment

compile-definition

compile-if

compile-lambda

compile-linkage

compile-proc-appl

compile-procedure-call

compile-quoted

compile-self-evaluating

compile-sequence

compile-time environment, [2], [3]

    open coding and

compile-variable

compiled-apply

compiled-procedure-entry

compiled-procedure-env

compiled-procedure?

compiler

    interpreter vs., [2]

    tail recursion, stack allocation, and garbage-collection

compiler for Scheme, see also code generator; compile-time environment; instruction sequence;

linkage descriptor; target register 

    analyzing evaluator vs., [2]

    assignments

    code generators, see 

compile-...

 

    combinations

    conditionals

---

    definitions

    efficiency

    example compilation

    explicit-control evaluator vs., [2], [3]

    expression-syntax procedures

    interfacing to evaluator

    label generation

    

lambda

 expressions

    lexical addressing

    linkage code

    machine-operation use

    monitoring performance (stack use) of compiled code, [2], [3]

    open coding of primitives, [2]

    order of operand evaluation

    procedure applications

    quotations

    register use, [2], [3]

    running compiled code

    scanning out internal definitions, [2]

    self-evaluating expressions

    sequences of expressions

    stack usage, [2], [3]

    structure of

    tail-recursive code generated by

    variables

complex

 package

complex numbers 

    polar representation

    rectangular representation

    rectangular vs. polar form

    represented as tagged data

complex->complex

complex-number arithmetic

    interfaced to generic arithmetic system

    structure of system

composition of functions

compound data, need for

compound expression, see also combination; special form 

    as operator of combination

compound procedure, see also procedure 

    used like primitive procedure

compound query

    processing, [2], [3], [4], [5]

compound-apply

compound-procedure?

computability, [2]

computational process, see also process 

computer science, [2]

    mathematics vs., [2]

concrete data representation

---

concurrency

    correctness of concurrent programs

    deadlock

    functional programming and

    mechanisms for controlling

cond

 (special form)

    additional clause syntax

    clause

    evaluation of

    

if

 vs.

    implicit 

begin

 in consequent

cond->if

cond-actions

cond-clauses

cond-else-clause?

cond-predicate

cond?

conditional expression 

    

cond

    

if

congruent modulo n

conjoin

connect

, [2]

connector(s), in constraint system

    operations on

    representing

Conniver

cons

 (primitive procedure)

    axiom for

    closure property of

    implemented with mutators

    implemented with vectors

    as list operation

    meaning of the name

    procedural implementation of, [2], [3], [4], [5], [6]

cons

 up a list

cons-stream

 (special form), [2]

    lazy evaluation and

    why a special form

consciousness, expansion of

consequent 

    of 

cond

 clause

    of 

if

const

 (in register machine)

    simulating

    syntax of

constant

 (primitive constraint)

constant, specifying in register machine

constant-exp

constant-exp-value

---

constraint network

constraint(s) 

    primitive

    propagation of

construct-arglist

constructor

    as abstraction barrier

contents

    using Scheme data types

continuation 

    in nondeterministic evaluator, [2], see also failure continuation; success continuation 

    in register-machine simulator

continue

 register

    in explicit-control evaluator

    recursion and

continued fraction

    e as

    golden ratio as

    tangent as

control structure

controller for register machine

    controller diagram

conventional interface

    sequence as

Cormen, Thomas H.

corner-split

correctness of a program

cos

 (primitive procedure)

cosine 

    fixed point of

    power series for

cosmic radiation

count-change

count-leaves

, [2]

    as accumulation

    as register machine

count-pairs

counting change, [2]

credit-card accounts, international

Cressey, David

cross-type operations

cryptography

cube

, [2], [3]

cube root 

    as fixed point

    by Newton’s method

cube-root

current time, for simulation agenda

current-time

, [2]

cycle in list

---