Structure and Interpretation of Computer Programs



Yüklə 2,71 Mb.
Pdf görüntüsü
səhifə217/222
tarix08.08.2018
ölçüsü2,71 Mb.
#61085
1   ...   214   215   216   217   218   219   220   221   222

nested definitionssee internal definition 

nested mappings, see mapping 

new

 register



new-cars

 register

new-cdrs

 register

new-withdraw

newline


 (primitive procedure), [2]

Newton’s method 

    for cube roots

    for differentiable functions

    half-interval method vs.

    for square roots, [2], [3]

newton-transform

newtons-method

next

 (linkage descriptor)



next-to

 (rules)


nil

 

    dispensing with



    as empty list

    as end-of-list marker

    as ordinary variable in Scheme

no-more-exps?

no-operands?

node of a tree

non-computable

non-strict

nondeterminism, in behavior of concurrent programs, [2]

nondeterministic choice point

nondeterministic computing

nondeterministic evaluator

    order of operand evaluation

nondeterministic programming vs. Scheme programming, [2], [3], [4]

nondeterministic programs 

    logic puzzles

    pairs with prime sums

    parsing natural language

    Pythagorean triples, [2], [3]

normal-order evaluation

    applicative order vs., [2], [3]

    delayed evaluation and

    in explicit-control evaluator

    of 


if

normal-order evaluator, see lazy evaluator 

not

 (primitive procedure)



not

 (query language), [2]

    evaluation of, [2], [3]

notation in this book 

    italic symbols in expression syntax

    slanted characters for interpreter response

nouns



nth root, as fixed point

null?


 (primitive procedure)

    implemented with typed pointers

number theory

number(s) 

    comparison of

    decimal point in

    equality of, [2], [3]

    in generic arithmetic system

    implementation dependencies

    integer vs. real number

    integer, exact

    in Lisp

    rational number

number?


 (primitive procedure)

    data types and

    implemented with typed pointers

numer


, [2]

    axiom for

    reducing to lowest terms

numerical analysis

numerical analyst

numerical data

obarray

object program



object(s)

    benefits of modeling with

    with time-varying state

object-oriented programming languages

old

 register



oldcr

 register

ones

 (infinite stream)



    lazy-list version

op

 (in register machine)



    simulating

open coding of primitives, [2]

operands

operands of a combination

operation 

    cross-type

    generic

    in register machine

operation-and-type table

    assignment needed for

    implementing

operation-exp

operation-exp-op

operation-exp-operands

operator

operator of a combination




    combination as

    compound expression as

    

lambda


 expression as

optimality 

    of Horner’s rule

    of Huffman code

or

 (query language)



    evaluation of, [2]

or

 (special form)



    evaluation of

    why a special form

    with no subexpressions

or-gate


    

or-gate


, [2]

order


, [2]

order notation

order of evaluation 

    assignment and

    implementation-dependent

    in compiler

    in explicit-control evaluator

    in metacircular evaluator

    in Scheme

order of events 

    decoupling apparent from actual

    indeterminacy in concurrent systems

order of growth

    linear iterative process

    linear recursive process

    logarithmic

    tree-recursive process

order of subexpression evaluation, see order of evaluation 

ordered-list representation of sets

ordinary numbers (in generic arithmetic system)

origin-frame

Ostrowski, A. M.

outranked-by

 (rule), [2]

P operation on semaphore

package


    complex-number

    polar representation

    polynomial

    rational-number

    rectangular representation

    Scheme-number

painter(s)

    higher-order operations

    operations

    represented as procedures

    transforming and combining



pair(s)

    axiomatic definition of

    box-and-pointer notation for

    infinite stream of

    lazy

    mutable

    procedural representation of, [2], [3]

    represented using vectors

    used to represent sequence

    used to represent tree

pair?

 (primitive procedure)



    implemented with typed pointers

pairs


Pan, V. Y.

parallel-execute

parallel-instruction-sequences

parallelism, see concurrency 

parameter, see formal parameters 

parameter passing, see call-by-name argument passing; call-by-need argument passing 

parentheses 

    delimiting combination

    delimiting 

cond


 clauses

    in procedure definition

parse

parse-...



parsing natural language

    real language understanding vs. toy parser

partial-sums

Pascal


    lack of higher-order procedures

    recursive procedures

    restrictions on compound data

    weakness in handling compound objects

Pascal, Blaise

Pascal’s triangle

password-protected bank account

pattern


pattern matching

    implementation

    unification vs., [2]

pattern variable

    representation of, [2]

pattern-match

pc

 register



perform

 (in register machine)

    simulating

perform-action

Perlis, Alan J., [2]

    quips, [2]

permutations of a set



Yüklə 2,71 Mb.

Dostları ilə paylaş:
1   ...   214   215   216   217   218   219   220   221   222




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©genderi.org 2024
rəhbərliyinə müraciət

    Ana səhifə