Structure and Interpretation of Computer Programs

    

permutations

Phillips, Hubert

 (pi) 

    approximation with half-interval method

    approximation with Monte Carlo integration, [2]

    Cesàro estimate for, [2]

    Leibniz’s series for, [2]

    stream of approximations

    Wallis’s formula for

pi-stream

pi-sum

    with higher-order procedures

    with 

lambda

picture language

Pingala, Áchárya

pipelining

Pitman, Kent M.

Planner

point, represented as a pair

pointer 

    in box-and-pointer notation

    typed

polar

 package

polar?

poly

polynomial

 package

polynomial arithmetic

    addition

    division

    Euclid’s Algorithm

    greatest common divisor, [2]

    interfaced to generic arithmetic system

    multiplication

    probabilistic algorithm for GCD

    rational functions

    subtraction

polynomial(s)

    canonical form

    dense

    evaluating with Horner’s rule

    hierarchy of types

    indeterminate of

    sparse

    univariate

pop

Portable Standard Lisp

porting a language

power series, as stream

    adding

    dividing

---

    integrating

    multiplying

PowerPC

predicate

    of 

cond

 clause

    of 

if

    naming convention for

prefix code

prefix notation

    infix notation vs.

prepositions

preserving

, [2], [3], [4]

pretty-printing

prime number(s)

    cryptography and

    Eratosthenes’s sieve for

    Fermat test for

    infinite stream of, see 

primes

 

    Miller-Rabin test for

    testing for

prime-sum-pair

prime-sum-pairs

    infinite stream

prime?

, [2]

primes

 (infinite stream)

    implicit definition

primitive constraints

primitive expression

    evaluation of

    name of primitive procedure

    name of variable

    number

primitive procedures (those marked ns are not in the IEEE Scheme standard) 

    

*

    

+

    

-

, [2]

    

/

    

<

    

=

    

>

    

apply

    

atan

    

car

    

cdr

    

cons

    

cos

    

display

    

eq?

    

error

 (ns)

    

eval

 (ns)

---

    

list

    

log

    

max

    

min

    

newline

    

not

    

null?

    

number?

    

pair?

    

quotient

    

random

 (ns), [2]

    

read

    

remainder

    

round

    

runtime

 (ns)

    

set-car!

    

set-cdr!

    

sin

    

symbol?

    

vector-ref

    

vector-set!

primitive query, see simple query 

primitive-apply

primitive-implementation

primitive-procedure-names

primitive-procedure-objects

primitive-procedure?

, [2]

principle of least commitment

print

 operation in register machine

print-point

print-queue

print-rat

print-result

    monitored-stack version

print-stack-statistics

 operation in register machine

printing, primitives for

probabilistic algorithm, [2], [3]

probe

 

    in constraint system

    in digital-circuit simulator

proc

 register

procedural abstraction

procedural representation of data

    mutable data

procedure, [2]

    anonymous

    arbitrary number of arguments, [2]

    as argument

    as black box

    body of

---

    compound

    creating with 

define

    creating with 

lambda

, [2], [3]

    as data

    definition of

    first-class in Lisp

    formal parameters of

    as general method

    generic, [2]

    higher-order, see higher-order procedure 

    implicit 

begin

 in body of

    mathematical function vs.

    memoized

    monitored

    name of

    naming (with 

define

)

    as pattern for local evolution of a process

    as returned value

    returning multiple values

    scope of formal parameters

    special form vs., [2]

procedure application 

    combination denoting

    environment model of

    substitution model of, see substitution model of procedure application 

procedure-body

procedure-environment

procedure-parameters

process

    iterative

    linear iterative

    linear recursive

    local evolution of

    order of growth of

    recursive

    resources required by

    shape of

    tree-recursive

product

    as accumulation

product?

program

    as abstract machine

    comments in

    as data

    incremental development of

    structure of, [2], [3], see also abstraction barriers 

    structured with subroutines

program counter

programming 

---