Concepts of Programming Languages

782 Index

H
Hammond, P., 758
Handles, 191–192
Harbison, Samuel P., 356
Hashes, 272–273, 276
introduction to, 96
Haskell, 707–712
Headed horn clauses, 734
Header files, 510–511
Headless horn clauses, 734
Heap-dynamic arrays, 263
Heap-dynamic variables, 290
Heaps, 289
Heavyweight tasks, 581
Hejlsberg, Anders, 90, 101
Hidden concurrency, 579
Higher-order functions, 675
High-Order Language Working
Group (HOLWG), 81
High-Performance Fortran (HPF),
621–623
Hoare, C.A.R.
on Ada, 83
on language design, 14, 23
message passing by, 593–594
on monitors, 591
Pascal by, 75
HOLWG (High-Order Language
Working Group), 81
Hopper, Grace
award in name of, 480, 536
compiling systems by, 41
on programming languages, 59
Horn clauses, 734
HPF (High-Performance Fortran),
621–623
HTML (HyperText Markup
Language)
introduction to, 7, 22
JavaScript and, 97–98
JSP and, 105
PHP and, 99
XML and, 104
Hursley Laboratory, 69

Hybrid implementation systems,

29–30

HyperText Markup Language

(HTML). see HTML

(HyperText Markup

Language)

Hypotheses, 734

I

IAL (International Algorithmic

Language), 54

IBM

APL developed by, 71

Fortran developed by, 42–47

orthogonality and, 10

PL/I developed by, 68, 73–74

PL/S developed by, 6

UNIVAC ”compiling” system

and, 41

“The IBM Mathematical

FORmula TRANslating

System: FORTRAN,” 43

id type, 551–552

Identifiers, 115, 204

Identity operators, 320

IEEE Floating-Point Standard,

247–248

Ierusalimschy, Roberto, 100,

274–275

If logical constructs, 45

IF selector functions, 685–686

if statements

assignments and, 340

in compound statements,

351

in Extended BNF, 130

in JSP, 105–106

in multiple-selection

statements, 360–362

in nesting selectors, 351–354

in recursive-descent parsers,

181–186

rules for, 119

in selector expressions, 354

IFIP (International Federation of

Information Processing), 75

if-then-else statements,

128–129, 325

Imperative programming

languages

functional languages

supporting, 715–717

functional languages vs.,

717–719

introduction to, 18

object-oriented hybrid

languages and. see C++

Implementation methods

compiler implementation,

24–28

hybrid implementation systems,

29–30

preprocessors in, 30

for protocols, 551

pure interpretation, 28

for subprograms. see

Subprograms,

implementing

understanding of, 4

Implicit declarations, 211

Implicit heap-dynamic arrays, 74

Implicit heap-dynamic variables,

218

Implicit locks, 612–613

import declarations, 515–516

In mode parameter passing, 400

in operators, 266

include statements, 565

Incremental mark-sweep garbage

collection, 301

Indicants, 74

Indices, 260–262

Inference rules

evaluation of, 160–161

in logical pretest loops,

154–158

in program proofs, 158–160

as rule of consequence, 152