-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbook-Z-H-38.html
3703 lines (3636 loc) · 247 KB
/
book-Z-H-38.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!doctype html public "-//W3C//DTD HTML 4.0 Transitional//EN" "http://www.w3.org/TR/REC-html40/loose.dtd">
<html>
<!-- Generated from TeX source by tex2page, v 4n,
(c) Dorai Sitaram, http://www.cs.rice.edu/~dorai/tex2page -->
<head>
<title>
Structure and Interpretation
of Computer Programs
</title>
<link rel="stylesheet" type="text/css" href="book-Z-C.css" title=default>
<meta name=robots content="noindex,follow">
</head>
<body>
<p><div class=navigation>[Go to <a href="book.html">first</a>,
<a href="book-Z-H-37.html">previous</a> page; <a href="book-Z-H-4.html#%_toc_start">contents</a>]</div><p>
<a name="%_chap_IGNORE"></a>
<h1 class=chapter>
<div class=chapterheading> </div><p>
<a href="book-Z-H-4.html#%_toc_%_chap_IGNORE">Index</a></h1><p>
<p>
<div align=right>
<table width=60%><tr><td>
<span class=epigraph>
Any inaccuracies in this index may be explained by the fact that it
has been prepared with the help of a computer.
<p><a name="%_idx_6794"></a>Donald E. Knuth,
<em>Fundamental Algorithms</em> (Volume 1 of
<em>The Art of Computer Programming</em>)
</span>
</td></tr></table>
</div>
<p>
<p><a name="%_index_start"><p>
<br>
<a href="book-Z-H-20.html#%_idx_2872"><tt>!</tt> in names</a><br>
<a href="book-Z-H-16.html#%_idx_2008"><tt>"</tt> (double quote)</a><br>
<img src="book-Z-G-D-6.gif"> calculus, <em>see</em> lambda calculus
<br>
<a href="book-Z-H-12.html#%_idx_1122"> <img src="book-Z-G-D-17.gif"> notation for mathematical function</a><br>
<img src="book-Z-G-D-9.gif"> , <em>see</em> pi
<br>
<a href="book-Z-H-12.html#%_idx_986">sum (sigma) notation</a><br>
<img src="book-Z-G-D-4.gif"> , <em>see</em> theta
<br>
<a href="book-Z-H-16.html#%_idx_2000"><tt>'</tt> (single quote)</a><br>
<a href="book-Z-H-26.html#%_idx_4526"><tt>read</tt> and</a>,
<a href="book-Z-H-29.html#%_idx_5406">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_168"><tt>*</tt> (primitive multiplication procedure)</a><br>
<a href="book-Z-H-10.html#%_idx_162"><tt>+</tt> (primitive addition procedure)</a><br>
<a href="book-Z-H-35.html#%_idx_6288"><tt>,</tt> (comma, used with backquote)</a><br>
<a href="book-Z-H-10.html#%_idx_170"><tt>-</tt> (primitive subtraction procedure)</a><br>
<a href="book-Z-H-10.html#%_idx_410">as negation</a><br>
<a href="book-Z-H-10.html#%_idx_176"><tt>/</tt> (primitive division procedure)</a><br>
<a href="book-Z-H-10.html#%_idx_394"><tt><</tt> (primitive numeric comparison predicate)</a><br>
<a href="book-Z-H-10.html#%_idx_396"><tt>=</tt> (primitive numeric equality predicate)</a><br>
<a href="book-Z-H-16.html#%_idx_2090"><tt>=number?</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2568"><tt>=zero?</tt> (generic)</a><br>
<a href="book-Z-H-18.html#%_idx_2752">for polynomials</a><br>
<a href="book-Z-H-10.html#%_idx_392"><tt>></tt> (primitive numeric comparison predicate)</a><br>
<a href="book-Z-H-10.html#%_idx_470"><tt>>=</tt></a>, <a href="book-Z-H-10.html#%_idx_472">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_524"><tt>?</tt> , in predicate names</a><br>
<a href="book-Z-H-10.html#%_idx_378"><tt>#f</tt></a><br>
<a href="book-Z-H-10.html#%_idx_372"><tt>#t</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6286"><tt>`</tt> (backquote)</a><br>
<tt>;</tt>, <em>see</em> semicolon<p>
<p><p>
<br>
<a href="book-Z-H-9.html#%_idx_106">Abelson, Harold</a><br>
<a href="book-Z-H-10.html#%_idx_358"><tt>abs</tt></a>, <a href="book-Z-H-10.html#%_idx_414">[2]</a>,
<a href="book-Z-H-10.html#%_idx_418">[3]</a><br>
<a href="book-Z-H-10.html#%_idx_348">absolute value</a><br>
<a href="book-Z-H-14.html#%_idx_1282">abstract data</a>,
<em>see also</em> data abstraction
<br>
<a href="book-Z-H-14.html#%_idx_1426">abstract models for data</a><br>
abstract syntax
<br>
<a href="book-Z-H-26.html#%_idx_4236">in metacircular evaluator</a><br>
<a href="book-Z-H-29.html#%_idx_5296">in query interpreter</a><br>
abstraction, <em>see also</em> means of abstraction; data abstraction; higher-order procedures
<br>
<a href="book-Z-H-12.html#%_idx_980">common pattern and</a><br>
<a href="book-Z-H-25.html#%_idx_4196">metalinguistic</a><br>
<a href="book-Z-H-10.html#%_idx_576">procedural</a><br>
<a href="book-Z-H-31.html#%_idx_5546">in register-machine design</a><br>
<a href="book-Z-H-28.html#%_idx_4924">of search in nondeterministic programming</a><br>
<a href="book-Z-H-13.html#%_idx_1264">abstraction barriers</a>,
<a href="book-Z-H-14.html#%_idx_1380">[2]</a>, <a href="book-Z-H-17.html#%_idx_2286">[3]</a><br>
<a href="book-Z-H-17.html#%_idx_2304">in complex-number system</a><br>
<a href="book-Z-H-18.html#%_idx_2498">in generic arithmetic system</a><br>
<a href="book-Z-H-24.html#%_idx_3976"><tt>accelerated-sequence</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1018"><tt>accumulate</tt></a>,
<a href="book-Z-H-15.html#%_idx_1742">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1810">same as <tt>fold-right</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1794"><tt>accumulate-n</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1736">accumulator</a>, <a href="book-Z-H-20.html#%_idx_2902">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_748">Áchárya, Bháscara</a><br>
<a href="book-Z-H-11.html#%_idx_708">Ackermann's function</a><br>
<a href="book-Z-H-23.html#%_idx_3642">acquire a mutex</a><br>
<a href="book-Z-H-31.html#%_idx_5534">actions, in register machine</a><br>
<a href="book-Z-H-27.html#%_idx_4722"><tt>actual-value</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5168">Ada</a><br>
<a href="book-Z-H-11.html#%_idx_684">recursive procedures</a><br>
<a href="book-Z-H-26.html#%_idx_4646">Adams, Norman I., IV</a><br>
<a href="book-Z-H-18.html#%_idx_2504"><tt>add</tt> (generic)</a><br>
<a href="book-Z-H-18.html#%_idx_2710">used for polynomial coefficients</a>,
<a href="book-Z-H-18.html#%_idx_2714">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3374"><tt>add-action!</tt></a>,
<a href="book-Z-H-22.html#%_idx_3408">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4476"><tt>add-binding-to-frame!</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2312"><tt>add-complex</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2578"><tt>add-complex-to-schemenum</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1488"><tt>add-interval</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4786"><tt>add-lists</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2674"><tt>add-poly</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1308"><tt>add-rat</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5382"><tt>add-rule-or-assertion!</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3864"><tt>add-streams</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2708"><tt>add-terms</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3420"><tt>add-to-agenda!</tt></a>,
<a href="book-Z-H-22.html#%_idx_3472">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1938"><tt>add-vect</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2074"><tt>addend</tt></a><br>
adder
<br>
<a href="book-Z-H-22.html#%_idx_3364">full</a><br>
<a href="book-Z-H-22.html#%_idx_3356">half</a><br>
<a href="book-Z-H-22.html#%_idx_3390">ripple-carry</a><br>
<a href="book-Z-H-22.html#%_idx_3532"><tt>adder</tt> (primitive constraint)</a><br>
<a href="book-Z-H-13.html#%_idx_1278">additivity</a>, <a href="book-Z-H-17.html#%_idx_2290">[2]</a>,
<a href="book-Z-H-17.html#%_idx_2426">[3]</a>, <a href="book-Z-H-18.html#%_idx_2534">[4]</a><br>
<a href="book-Z-H-33.html#%_idx_5834">address</a><br>
<a href="book-Z-H-33.html#%_idx_5838">address arithmetic</a><br>
<a href="book-Z-H-11.html#%_idx_926">Adelman, Leonard</a><br>
<a href="book-Z-H-34.html#%_idx_6062"><tt>adjoin-arg</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2106"><tt>adjoin-set</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2162">binary-tree representation</a><br>
<a href="book-Z-H-16.html#%_idx_2132">ordered-list representation</a><br>
<a href="book-Z-H-16.html#%_idx_2118">unordered-list representation</a><br>
<a href="book-Z-H-16.html#%_idx_2274">for weighted sets</a><br>
<a href="book-Z-H-18.html#%_idx_2694"><tt>adjoin-term</tt></a>,
<a href="book-Z-H-18.html#%_idx_2734">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5732"><tt>advance-pc</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3376"><tt>after-delay</tt></a>,
<a href="book-Z-H-22.html#%_idx_3424">[2]</a><br>
agenda, <em>see</em> digital-circuit simulation
<br>
<a href="book-Z-H-11.html#%_idx_826">A'h-mose</a><br>
algebra, symbolic, <em>see</em> symbolic algebra
<br>
<a href="book-Z-H-18.html#%_idx_2648">algebraic expression</a><br>
<a href="book-Z-H-16.html#%_idx_2046">differentiating</a><br>
<a href="book-Z-H-16.html#%_idx_2058">representing</a><br>
<a href="book-Z-H-16.html#%_idx_2084">simplifying</a><br>
<a href="book-Z-H-14.html#%_idx_1442">algebraic specification for data</a><br>
Algol
<br>
<a href="book-Z-H-10.html#%_idx_628">block structure</a><br>
<a href="book-Z-H-24.html#%_idx_3806">call-by-name argument passing</a>,
<a href="book-Z-H-27.html#%_idx_4716">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3822">thunks</a>, <a href="book-Z-H-27.html#%_idx_4700">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3568">weakness in handling compound objects</a><br>
algorithm
<br>
<a href="book-Z-H-15.html#%_idx_1780">optimal</a><br>
<a href="book-Z-H-11.html#%_idx_910">probabilistic</a>,
<a href="book-Z-H-18.html#%_idx_2816">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2998">aliasing</a><br>
<a href="book-Z-H-35.html#%_idx_6374"><tt>all-regs</tt> (compiler)</a><br>
<a href="book-Z-H-33.html#%_idx_5960">Allen, John</a><br>
<a href="book-Z-H-10.html#%_idx_438">alternative of <tt>if</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5338"><tt>always-true</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4822"><tt>amb</tt></a><br>
<tt>amb</tt> evaluator, <em>see</em> nondeterministic evaluator
<br>
<a href="book-Z-H-28.html#%_idx_4994"><tt>ambeval</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4830"><tt>an-element-of</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4832"><tt>an-integer-starting-from</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4064">analog computer</a><br>
<tt>analyze</tt>
<br>
<a href="book-Z-H-26.html#%_idx_4656">metacircular</a><br>
<a href="book-Z-H-28.html#%_idx_4992">nondeterministic</a><br>
<tt>analyze-...</tt>
<br>
<a href="book-Z-H-26.html#%_idx_4658">metacircular</a>,
<a href="book-Z-H-26.html#%_idx_4664">[2]</a><br>
<a href="book-Z-H-28.html#%_idx_5004">nondeterministic</a><br>
<a href="book-Z-H-28.html#%_idx_5016"><tt>analyze-amb</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4636">analyzing evaluator</a><br>
<a href="book-Z-H-28.html#%_idx_4980">as basis for nondeterministic evaluator</a><br>
<a href="book-Z-H-26.html#%_idx_4662"><tt>let</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5124"><tt>and</tt> (query language)</a><br>
<a href="book-Z-H-29.html#%_idx_5198">evaluation of</a>,
<a href="book-Z-H-29.html#%_idx_5318">[2]</a>, <a href="book-Z-H-29.html#%_idx_5428">[3]</a><br>
<a href="book-Z-H-10.html#%_idx_446"><tt>and</tt> (special form)</a><br>
<a href="book-Z-H-10.html#%_idx_450">evaluation of</a><br>
<a href="book-Z-H-10.html#%_idx_466">why a special form</a><br>
<a href="book-Z-H-26.html#%_idx_4396">with no subexpressions</a><br>
<a href="book-Z-H-22.html#%_idx_3346">and-gate</a><br>
<a href="book-Z-H-22.html#%_idx_3382"><tt>and-gate</tt></a><br>
<tt>angle</tt>
<br>
<a href="book-Z-H-17.html#%_idx_2470">data-directed</a><br>
<a href="book-Z-H-17.html#%_idx_2350">polar representation</a><br>
<a href="book-Z-H-17.html#%_idx_2334">rectangular representation</a><br>
<a href="book-Z-H-17.html#%_idx_2412">with tagged data</a><br>
<a href="book-Z-H-17.html#%_idx_2396"><tt>angle-polar</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2384"><tt>angle-rectangular</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4536"><tt>announce-output</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1764">APL</a><br>
<a href="book-Z-H-35.html#%_idx_6366">Appel, Andrew W.</a><br>
<a href="book-Z-H-15.html#%_idx_1632"><tt>append</tt></a>, <a href="book-Z-H-15.html#%_idx_1636">[2]</a>,
<a href="book-Z-H-22.html#%_idx_3164">[3]</a><br>
<a href="book-Z-H-15.html#%_idx_1768">as accumulation</a><br>
<a href="book-Z-H-22.html#%_idx_3162"><tt>append!</tt> vs.</a><br>
<a href="book-Z-H-35.html#%_idx_6396">with arbitrary number of arguments</a><br>
<a href="book-Z-H-33.html#%_idx_5926">as register machine</a><br>
<a href="book-Z-H-29.html#%_idx_5074">``what is'' (rules) vs. ``how to'' (procedure)</a><br>
<a href="book-Z-H-22.html#%_idx_3166"><tt>append!</tt></a><br>
<a href="book-Z-H-33.html#%_idx_5928">as register machine</a><br>
<a href="book-Z-H-35.html#%_idx_6260"><tt>append-instruction-sequences</tt></a>,
<a href="book-Z-H-35.html#%_idx_6390">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5158"><tt>append-to-form</tt> (rules)</a><br>
<a href="book-Z-H-26.html#%_idx_4340"><tt>application?</tt></a><br>
<a href="book-Z-H-10.html#%_idx_342">applicative-order evaluation</a><br>
<a href="book-Z-H-10.html#%_idx_344">in Lisp</a><br>
<a href="book-Z-H-10.html#%_idx_482">normal order vs.</a>,
<a href="book-Z-H-11.html#%_idx_854">[2]</a>, <a href="book-Z-H-27.html#%_idx_4682">[3]</a><br>
<a href="book-Z-H-27.html#%_idx_4724"><tt>apply</tt> (lazy)</a><br>
<a href="book-Z-H-26.html#%_idx_4250"><tt>apply</tt> (metacircular)</a><br>
<a href="book-Z-H-26.html#%_idx_4578">primitive <tt>apply</tt> vs.</a><br>
<a href="book-Z-H-17.html#%_idx_2458"><tt>apply</tt> (primitive procedure)</a><br>
<a href="book-Z-H-34.html#%_idx_6072"><tt>apply-dispatch</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6474">modified for compiled code</a><br>
<a href="book-Z-H-17.html#%_idx_2462"><tt>apply-generic</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2590">with coercion</a>,
<a href="book-Z-H-18.html#%_idx_2626">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2636">with coercion by raising</a><br>
<a href="book-Z-H-18.html#%_idx_2632">with coercion of multiple arguments</a><br>
<a href="book-Z-H-18.html#%_idx_2638">with coercion to simplify</a><br>
<a href="book-Z-H-17.html#%_idx_2490">with message passing</a><br>
<a href="book-Z-H-18.html#%_idx_2610">with tower of types</a><br>
<a href="book-Z-H-26.html#%_idx_4248"><tt>apply-primitive-procedure</tt></a>,
<a href="book-Z-H-26.html#%_idx_4440">[2]</a>, <a href="book-Z-H-26.html#%_idx_4514">[3]</a><br>
<a href="book-Z-H-29.html#%_idx_5358"><tt>apply-rules</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3684">arbiter</a><br>
<a href="book-Z-H-17.html#%_idx_2322">arctangent</a><br>
<a href="book-Z-H-34.html#%_idx_6028"><tt>argl</tt> register</a><br>
argument passing, <em>see</em> call-by-name argument passing; call-by-need argument passing
<br>
<a href="book-Z-H-10.html#%_idx_188">argument(s)</a><br>
<a href="book-Z-H-10.html#%_idx_194">arbitrary number of</a>,
<a href="book-Z-H-15.html#%_idx_1652">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_4070">delayed</a><br>
<a href="book-Z-H-23.html#%_idx_3688">Aristotle's <i>De caelo</i> (Buridan's commentary on)</a><br>
arithmetic
<br>
<a href="book-Z-H-33.html#%_idx_5840">address arithmetic</a><br>
<a href="book-Z-H-18.html#%_idx_2496">generic</a>,
<em>see also</em> generic arithmetic operations
<br>
<a href="book-Z-H-17.html#%_idx_2302">on complex numbers</a><br>
<a href="book-Z-H-14.html#%_idx_1480">on intervals</a><br>
on polynomials, <em>see</em> polynomial arithmetic
<br>
<a href="book-Z-H-24.html#%_idx_3930">on power series</a>,
<a href="book-Z-H-24.html#%_idx_3936">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1294">on rational numbers</a><br>
<a href="book-Z-H-10.html#%_idx_160">primitive procedures for</a><br>
<a href="book-Z-H-28.html#%_idx_4960"><tt>articles</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2214">ASCII code</a><br>
<a href="book-Z-H-32.html#%_idx_5686"><tt>assemble</tt></a>, <a href="book-Z-H-32.html#%_idx_5694">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5636">assembler</a>, <a href="book-Z-H-32.html#%_idx_5682">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5240"><tt>assert!</tt> (query interpreter)</a><br>
<a href="book-Z-H-29.html#%_idx_5104">assertion</a><br>
<a href="book-Z-H-29.html#%_idx_5148">implicit</a><br>
<a href="book-Z-H-31.html#%_idx_5518"><tt>assign</tt> (in register machine)</a><br>
<a href="book-Z-H-32.html#%_idx_5720">simulating</a><br>
<a href="book-Z-H-31.html#%_idx_5556">storing label in register</a><br>
<a href="book-Z-H-32.html#%_idx_5724"><tt>assign-reg-name</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5726"><tt>assign-value-exp</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2836">assignment</a>, <em>see also</em> <tt>set!</tt>
<br>
<a href="book-Z-H-20.html#%_idx_2916">benefits of</a><br>
<a href="book-Z-H-20.html#%_idx_3004">bugs associated with</a>,
<a href="book-Z-H-20.html#%_idx_3022">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2976">costs of</a><br>
<a href="book-Z-H-20.html#%_idx_2842">assignment operator</a>,
<em>see also</em> <tt>set!</tt>
<br>
<a href="book-Z-H-26.html#%_idx_4296"><tt>assignment-value</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4294"><tt>assignment-variable</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4292"><tt>assignment?</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3282"><tt>assoc</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2324"><tt>atan</tt> (primitive procedure)</a><br>
<a href="book-Z-H-23.html#%_idx_3682">atomic operations supported in hardware</a><br>
<a href="book-Z-H-23.html#%_idx_3672">atomic requirement for <tt>test-and-set!</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2368"><tt>attach-tag</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2558">using Scheme data types</a><br>
<a href="book-Z-H-16.html#%_idx_2076"><tt>augend</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4846">automagically</a><br>
<a href="book-Z-H-28.html#%_idx_4808">automatic search</a>,
<em>see also</em> search
<br>
<a href="book-Z-H-28.html#%_idx_4860">history of</a><br>
<a href="book-Z-H-33.html#%_idx_5832">automatic storage allocation</a><br>
<a href="book-Z-H-10.html#%_idx_516"><tt>average</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1128">average damping</a><br>
<a href="book-Z-H-12.html#%_idx_1160"><tt>average-damp</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3560"><tt>averager</tt> (constraint)</a><p>
<p><p>
<br>
<a href="book-Z-H-16.html#%_idx_2172">B-tree</a><br>
<a href="book-Z-H-35.html#%_idx_6282">backquote</a><br>
<a href="book-Z-H-28.html#%_idx_4852">backtracking</a>,
<em>see also</em> nondeterministic computing
<br>
<a href="book-Z-H-24.html#%_idx_4166">Backus, John</a><br>
<a href="book-Z-H-33.html#%_idx_5948">Baker, Henry G., Jr.</a><br>
<a href="book-Z-H-16.html#%_idx_2164">balanced binary tree</a>,
<em>see also</em> binary tree
<br>
<a href="book-Z-H-15.html#%_idx_1702">balanced mobile</a><br>
<a href="book-Z-H-20.html#%_idx_2848">bank account</a>, <a href="book-Z-H-21.html#%_idx_3124">[2]</a><br>
<a href="book-Z-H-23.html#%_idx_3626">exchanging balances</a><br>
<a href="book-Z-H-20.html#%_idx_2996">joint</a>, <a href="book-Z-H-20.html#%_idx_3026">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_4176">joint, modeled with streams</a><br>
<a href="book-Z-H-23.html#%_idx_3588">joint, with concurrent access</a><br>
<a href="book-Z-H-20.html#%_idx_2912">password-protected</a><br>
<a href="book-Z-H-23.html#%_idx_3614">serialized</a><br>
<a href="book-Z-H-24.html#%_idx_4148">stream model</a><br>
<a href="book-Z-H-23.html#%_idx_3636">transferring money</a><br>
<a href="book-Z-H-23.html#%_idx_3710">barrier synchronization</a><br>
<a href="book-Z-H-25.html#%_idx_4188">Barth, John</a><br>
Basic
<br>
<a href="book-Z-H-15.html#%_idx_1546">restrictions on compound data</a><br>
<a href="book-Z-H-22.html#%_idx_3570">weakness in handling compound objects</a><br>
<a href="book-Z-H-34.html#%_idx_6004">Batali, John Dean</a><br>
<a href="book-Z-H-20.html#%_idx_2874"><tt>begin</tt> (special form)</a><br>
<a href="book-Z-H-20.html#%_idx_2878">implicit in consequent of <tt>cond</tt> and in procedure body</a><br>
<a href="book-Z-H-26.html#%_idx_4328"><tt>begin-actions</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4326"><tt>begin?</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1880"><tt>below</tt></a>, <a href="book-Z-H-15.html#%_idx_1976">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3880">Bertrand's Hypothesis</a><br>
<a href="book-Z-H-15.html#%_idx_1878"><tt>beside</tt></a>, <a href="book-Z-H-15.html#%_idx_1972">[2]</a><br>
<a href="book-Z-H-33.html#%_idx_5880">bignum</a><br>
binary numbers, addition of, <em>see</em> adder
<br>
<a href="book-Z-H-16.html#%_idx_2144">binary search</a><br>
<a href="book-Z-H-16.html#%_idx_2142">binary tree</a><br>
<a href="book-Z-H-16.html#%_idx_2166">balanced</a><br>
<a href="book-Z-H-16.html#%_idx_2188">converting a list to a</a><br>
<a href="book-Z-H-16.html#%_idx_2182">converting to a list</a><br>
<a href="book-Z-H-16.html#%_idx_2240">for Huffman encoding</a><br>
<a href="book-Z-H-16.html#%_idx_2150">represented with lists</a><br>
<a href="book-Z-H-16.html#%_idx_2138">sets represented as</a><br>
<a href="book-Z-H-22.html#%_idx_3310">table structured as</a><br>
<a href="book-Z-H-10.html#%_idx_588">bind</a><br>
<a href="book-Z-H-21.html#%_idx_3042">binding</a><br>
<a href="book-Z-H-26.html#%_idx_4490">deep</a><br>
<a href="book-Z-H-11.html#%_idx_740">binomial coefficients</a><br>
<a href="book-Z-H-10.html#%_idx_572">black box</a><br>
<a href="book-Z-H-10.html#%_idx_612">block structure</a>, <a href="book-Z-H-26.html#%_idx_4600">[2]</a><br>
<a href="book-Z-H-21.html#%_idx_3112">in environment model</a><br>
<a href="book-Z-H-29.html#%_idx_5448">in query language</a><br>
<a href="book-Z-H-23.html#%_idx_3664">blocked process</a><br>
<a href="book-Z-H-10.html#%_idx_324">body of a procedure</a><br>
<a href="book-Z-H-9.html#%_idx_62">Bolt Beranek and Newman Inc.</a><br>
<a href="book-Z-H-22.html#%_idx_3492">Borning, Alan</a><br>
<a href="book-Z-H-15.html#%_idx_1788">Borodin, Alan</a><br>
<a href="book-Z-H-10.html#%_idx_584">bound variable</a><br>
<a href="book-Z-H-15.html#%_idx_1528">box-and-pointer notation</a><br>
<a href="book-Z-H-15.html#%_idx_1560">end-of-list marker</a><br>
<a href="book-Z-H-31.html#%_idx_5506"><tt>branch</tt> (in register machine)</a><br>
<a href="book-Z-H-32.html#%_idx_5740">simulating</a><br>
<a href="book-Z-H-10.html#%_idx_258">branch of a tree</a><br>
<a href="book-Z-H-32.html#%_idx_5744"><tt>branch-dest</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5826">breakpoint</a><br>
<a href="book-Z-H-33.html#%_idx_5980">broken heart</a><br>
<a href="book-Z-H-9.html#%_idx_18">bug</a><br>
<a href="book-Z-H-10.html#%_idx_606">capturing a free variable</a><br>
<a href="book-Z-H-20.html#%_idx_3020">order of assignments</a><br>
<a href="book-Z-H-20.html#%_idx_3002">side effect with aliasing</a><br>
<a href="book-Z-H-29.html#%_idx_5254">bureaucracy</a><br>
<a href="book-Z-H-23.html#%_idx_3686">Buridan, Jean</a><br>
<a href="book-Z-H-23.html#%_idx_3666">busy-waiting</a><p>
<p><p>
<br>
C
<br>
<a href="book-Z-H-35.html#%_idx_6520">compiling Scheme into</a><br>
<a href="book-Z-H-34.html#%_idx_6186">error handling</a>,
<a href="book-Z-H-35.html#%_idx_6496">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_688">recursive procedures</a><br>
<a href="book-Z-H-15.html#%_idx_1550">restrictions on compound data</a><br>
<a href="book-Z-H-35.html#%_idx_6518">Scheme interpreter written in</a>,
<a href="book-Z-H-35.html#%_idx_6522">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1588"><tt>ca<tt>...</tt>r</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3594">cache-coherence protocols</a><br>
<a href="book-Z-H-15.html#%_idx_1586"><tt>cadr</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1108">calculator, fixed points with</a><br>
<a href="book-Z-H-24.html#%_idx_3808">call-by-name argument passing</a>,
<a href="book-Z-H-27.html#%_idx_4714">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3816">call-by-need argument passing</a>,
<a href="book-Z-H-27.html#%_idx_4712">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3902">memoization and</a><br>
<a href="book-Z-H-22.html#%_idx_3398"><tt>call-each</tt></a><br>
<a href="book-Z-H-10.html#%_idx_286">cancer of the semicolon</a><br>
<a href="book-Z-H-18.html#%_idx_2770">canonical form, for polynomials</a><br>
<a href="book-Z-H-10.html#%_idx_604">capturing a free variable</a><br>
<a href="book-Z-H-14.html#%_idx_1324"><tt>car</tt> (primitive procedure)</a><br>
<a href="book-Z-H-14.html#%_idx_1454">axiom for</a><br>
<a href="book-Z-H-33.html#%_idx_5896">implemented with vectors</a><br>
<a href="book-Z-H-15.html#%_idx_1580">as list operation</a><br>
<a href="book-Z-H-14.html#%_idx_1334">origin of the name</a><br>
<a href="book-Z-H-14.html#%_idx_1462">procedural implementation of</a>,
<a href="book-Z-H-14.html#%_idx_1470">[2]</a>, <a href="book-Z-H-22.html#%_idx_3206">[3]</a>,
<a href="book-Z-H-22.html#%_idx_3212">[4]</a>, <a href="book-Z-H-27.html#%_idx_4776">[5]</a><br>
<a href="book-Z-H-11.html#%_idx_912">Carmichael numbers</a>,
<a href="book-Z-H-11.html#%_idx_948">[2]</a><br>
case analysis
<br>
<a href="book-Z-H-26.html#%_idx_4246">data-directed programming vs.</a><br>
<a href="book-Z-H-10.html#%_idx_350">general</a>, <em>see also</em> <tt>cond</tt>
<br>
<a href="book-Z-H-10.html#%_idx_426">with two cases (<tt>if</tt>)</a><br>
<a href="book-Z-H-15.html#%_idx_1590"><tt>cd<tt>...</tt>r</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1328"><tt>cdr</tt> (primitive procedure)</a><br>
<a href="book-Z-H-14.html#%_idx_1456">axiom for</a><br>
<a href="book-Z-H-33.html#%_idx_5898">implemented with vectors</a><br>
<a href="book-Z-H-15.html#%_idx_1582">as list operation</a><br>
<a href="book-Z-H-14.html#%_idx_1336">origin of the name</a><br>
<a href="book-Z-H-14.html#%_idx_1464">procedural implementation of</a>,
<a href="book-Z-H-14.html#%_idx_1472">[2]</a>, <a href="book-Z-H-22.html#%_idx_3208">[3]</a>,
<a href="book-Z-H-22.html#%_idx_3214">[4]</a>, <a href="book-Z-H-27.html#%_idx_4778">[5]</a><br>
<a href="book-Z-H-15.html#%_idx_1606"><tt>cdr</tt> down a list</a><br>
<a href="book-Z-H-23.html#%_idx_3662">cell, in serializer implementation</a><br>
<a href="book-Z-H-22.html#%_idx_3518"><tt>celsius-fahrenheit-converter</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3566">expression-oriented</a><br>
<a href="book-Z-H-14.html#%_idx_1518"><tt>center</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2942">Cesàro, Ernesto</a><br>
<a href="book-Z-H-24.html#%_idx_4128"><tt>cesaro-stream</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2950"><tt>cesaro-test</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2932">Chaitin, Gregory</a><br>
<a href="book-Z-H-11.html#%_idx_810">Chandah-sutra</a><br>
change and sameness
<br>
<a href="book-Z-H-20.html#%_idx_2988">meaning of</a><br>
<a href="book-Z-H-22.html#%_idx_3182">shared data and</a><br>
changing money, <em>see</em> counting change
<br>
<a href="book-Z-H-9.html#%_idx_104">chaos in the Solar System</a><br>
<a href="book-Z-H-28.html#%_idx_4904">Chapman, David</a><br>
character strings
<br>
<a href="book-Z-H-29.html#%_idx_5410">primitive procedures for</a>,
<a href="book-Z-H-35.html#%_idx_6320">[2]</a><br>
<a href="book-Z-H-16.html#%_idx_2006">quotation of</a><br>
<a href="book-Z-H-16.html#%_idx_2218">character, ASCII encoding</a><br>
<a href="book-Z-H-28.html#%_idx_4872">Charniak, Eugene</a><br>
<a href="book-Z-H-24.html#%_idx_3878">Chebyshev, Pafnutii L'vovich</a><br>
<a href="book-Z-H-15.html#%_idx_1848">chess, eight-queens puzzle</a>,
<a href="book-Z-H-28.html#%_idx_4944">[2]</a><br>
<a href="book-Z-H-34.html#%_idx_6002">chip implementation of Scheme</a>,
<a href="book-Z-H-34.html#%_idx_6014">[2]</a><br>
<a href="book-Z-H-28.html#%_idx_4858">chronological backtracking</a><br>
<a href="book-Z-H-11.html#%_idx_750">Chu Shih-chieh</a><br>
<a href="book-Z-H-14.html#%_idx_1474">Church numerals</a><br>
<a href="book-Z-H-12.html#%_idx_1056">Church, Alonzo</a>, <a href="book-Z-H-14.html#%_idx_1476">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4562">Church-Turing thesis</a><br>
circuit
<br>
digital, <em>see</em> digital-circuit simulation
<br>
<a href="book-Z-H-24.html#%_idx_4030">modeled with streams</a>,
<a href="book-Z-H-24.html#%_idx_4088">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5274">Clark, Keith L.</a><br>
<a href="book-Z-H-10.html#%_idx_362">clause, of a <tt>cond</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4402">additional syntax</a><br>
<a href="book-Z-H-26.html#%_idx_4378">Clinger, William</a>,
<a href="book-Z-H-27.html#%_idx_4718">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5272">closed world assumption</a><br>
<a href="book-Z-H-13.html#%_idx_1266">closure</a><br>
<a href="book-Z-H-15.html#%_idx_1536">in abstract algebra</a><br>
<a href="book-Z-H-15.html#%_idx_1532">closure property of <tt>cons</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1860">closure property of picture-language operations</a>, <a href="book-Z-H-15.html#%_idx_1886">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1542">lack of in many languages</a><br>
<a href="book-Z-H-15.html#%_idx_1872">coal, bituminous</a><br>
code
<br>
<a href="book-Z-H-16.html#%_idx_2216">ASCII</a><br>
<a href="book-Z-H-16.html#%_idx_2222">fixed-length</a><br>
Huffman, <em>see</em> Huffman code
<br>
<a href="book-Z-H-16.html#%_idx_2230">Morse</a><br>
<a href="book-Z-H-16.html#%_idx_2236">prefix</a><br>
<a href="book-Z-H-16.html#%_idx_2226">variable-length</a><br>
<a href="book-Z-H-35.html#%_idx_6242">code generator</a><br>
<a href="book-Z-H-35.html#%_idx_6246">arguments of</a><br>
<a href="book-Z-H-35.html#%_idx_6258">value of</a><br>
<a href="book-Z-H-18.html#%_idx_2706"><tt>coeff</tt></a>, <a href="book-Z-H-18.html#%_idx_2748">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2580">coercion</a><br>
<a href="book-Z-H-18.html#%_idx_2774">in algebraic manipulation</a><br>
<a href="book-Z-H-18.html#%_idx_2718">in polynomial arithmetic</a><br>
<a href="book-Z-H-18.html#%_idx_2582">procedure</a><br>
<a href="book-Z-H-18.html#%_idx_2588">table</a><br>
<a href="book-Z-H-29.html#%_idx_5054">Colmerauer, Alain</a><br>
<a href="book-Z-H-10.html#%_idx_156">combination</a><br>
<a href="book-Z-H-12.html#%_idx_1162">combination as operator of</a><br>
<a href="book-Z-H-10.html#%_idx_474">compound expression as operator of</a><br>
<a href="book-Z-H-10.html#%_idx_244">evaluation of</a><br>
<a href="book-Z-H-12.html#%_idx_1048"><tt>lambda</tt> expression as operator of</a><br>
<a href="book-Z-H-12.html#%_idx_1164">as operator of combination</a><br>
<a href="book-Z-H-10.html#%_idx_252">as a tree</a><br>
<a href="book-Z-H-10.html#%_idx_124">combination, means of</a>,
<em>see also</em> closure
<br>
<a href="book-Z-H-35.html#%_idx_6290">comma, used with backquote</a><br>
<a href="book-Z-H-15.html#%_idx_1836">comments in programs</a><br>
<a href="book-Z-H-9.html#%_idx_92">Common Lisp</a><br>
<a href="book-Z-H-15.html#%_idx_1600">treatment of <tt>nil</tt></a><br>
<a href="book-Z-H-33.html#%_idx_5962">compacting garbage collector</a><br>
compilation, <em>see</em> compiler
<br>
<a href="book-Z-H-35.html#%_idx_6244"><tt>compile</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6472"><tt>compile-and-go</tt></a>,
<a href="book-Z-H-35.html#%_idx_6484">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6514"><tt>compile-and-run</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6346"><tt>compile-application</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6312"><tt>compile-assignment</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6314"><tt>compile-definition</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6324"><tt>compile-if</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6340"><tt>compile-lambda</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6292"><tt>compile-linkage</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6376"><tt>compile-proc-appl</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6350"><tt>compile-procedure-call</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6304"><tt>compile-quoted</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6302"><tt>compile-self-evaluating</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6328"><tt>compile-sequence</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6440">compile-time environment</a>,
<a href="book-Z-H-35.html#%_idx_6450">[2]</a>, <a href="book-Z-H-35.html#%_idx_6452">[3]</a><br>
<a href="book-Z-H-35.html#%_idx_6464">open coding and</a><br>
<a href="book-Z-H-35.html#%_idx_6306"><tt>compile-variable</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6476"><tt>compiled-apply</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6336"><tt>compiled-procedure-entry</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6338"><tt>compiled-procedure-env</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6334"><tt>compiled-procedure?</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6194">compiler</a><br>
<a href="book-Z-H-35.html#%_idx_6210">interpreter vs.</a>,
<a href="book-Z-H-35.html#%_idx_6492">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6356">tail recursion, stack allocation, and garbage-collection</a><br>
<a href="book-Z-H-35.html#%_idx_6224">compiler for Scheme</a>,
<em>see also</em> code generator; compile-time environment; instruction sequence; linkage descriptor; target register
<br>
<a href="book-Z-H-35.html#%_idx_6234">analyzing evaluator vs.</a>,
<a href="book-Z-H-35.html#%_idx_6238">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6308">assignments</a><br>
code generators, <em>see</em> <tt>compile-...</tt>
<br>
<a href="book-Z-H-35.html#%_idx_6344">combinations</a><br>
<a href="book-Z-H-35.html#%_idx_6316">conditionals</a><br>
<a href="book-Z-H-35.html#%_idx_6310">definitions</a><br>
<a href="book-Z-H-35.html#%_idx_6232">efficiency</a><br>
<a href="book-Z-H-35.html#%_idx_6404">example compilation</a><br>
<a href="book-Z-H-35.html#%_idx_6226">explicit-control evaluator vs.</a>,
<a href="book-Z-H-35.html#%_idx_6274">[2]</a>, <a href="book-Z-H-35.html#%_idx_6488">[3]</a><br>
<a href="book-Z-H-35.html#%_idx_6240">expression-syntax procedures</a><br>
<a href="book-Z-H-35.html#%_idx_6466">interfacing to evaluator</a><br>
<a href="book-Z-H-35.html#%_idx_6318">label generation</a><br>
<a href="book-Z-H-35.html#%_idx_6330"><tt>lambda</tt> expressions</a><br>
<a href="book-Z-H-35.html#%_idx_6428">lexical addressing</a><br>
<a href="book-Z-H-35.html#%_idx_6278">linkage code</a><br>
<a href="book-Z-H-35.html#%_idx_6222">machine-operation use</a><br>
<a href="book-Z-H-35.html#%_idx_6486">monitoring performance (stack use) of compiled code</a>, <a href="book-Z-H-35.html#%_idx_6506">[2]</a>,
<a href="book-Z-H-35.html#%_idx_6510">[3]</a><br>
<a href="book-Z-H-35.html#%_idx_6422">open coding of primitives</a>,
<a href="book-Z-H-35.html#%_idx_6458">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6416">order of operand evaluation</a><br>
<a href="book-Z-H-35.html#%_idx_6342">procedure applications</a><br>
<a href="book-Z-H-35.html#%_idx_6298">quotations</a><br>
<a href="book-Z-H-35.html#%_idx_6220">register use</a>,
<a href="book-Z-H-35.html#%_idx_6228">[2]</a>, <a href="book-Z-H-35.html#%_idx_6372">[3]</a><br>
<a href="book-Z-H-35.html#%_idx_6468">running compiled code</a><br>
<a href="book-Z-H-35.html#%_idx_6448">scanning out internal definitions</a>,
<a href="book-Z-H-35.html#%_idx_6456">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6296">self-evaluating expressions</a><br>
<a href="book-Z-H-35.html#%_idx_6326">sequences of expressions</a><br>
<a href="book-Z-H-35.html#%_idx_6262">stack usage</a>,
<a href="book-Z-H-35.html#%_idx_6270">[2]</a>, <a href="book-Z-H-35.html#%_idx_6418">[3]</a><br>
<a href="book-Z-H-35.html#%_idx_6236">structure of</a><br>
<a href="book-Z-H-35.html#%_idx_6352">tail-recursive code generated by</a><br>
<a href="book-Z-H-35.html#%_idx_6300">variables</a><br>
<a href="book-Z-H-18.html#%_idx_2538"><tt>complex</tt> package</a><br>
complex numbers
<br>
<a href="book-Z-H-17.html#%_idx_2340">polar representation</a><br>
<a href="book-Z-H-17.html#%_idx_2320">rectangular representation</a><br>
<a href="book-Z-H-17.html#%_idx_2306">rectangular vs. polar form</a><br>
<a href="book-Z-H-17.html#%_idx_2356">represented as tagged data</a><br>
<a href="book-Z-H-18.html#%_idx_2630"><tt>complex->complex</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2300">complex-number arithmetic</a><br>
<a href="book-Z-H-18.html#%_idx_2540">interfaced to generic arithmetic system</a><br>
<a href="book-Z-H-17.html#%_idx_2418">structure of system</a><br>
<a href="book-Z-H-12.html#%_idx_1226">composition of functions</a><br>
<a href="book-Z-H-13.html#%_idx_1256">compound data, need for</a><br>
<a href="book-Z-H-10.html#%_idx_154">compound expression</a>,
<em>see also</em> combination; special form
<br>
<a href="book-Z-H-10.html#%_idx_476">as operator of combination</a><br>
<a href="book-Z-H-10.html#%_idx_296">compound procedure</a>,
<em>see also</em> procedure
<br>
<a href="book-Z-H-10.html#%_idx_332">used like primitive procedure</a><br>
<a href="book-Z-H-29.html#%_idx_5122">compound query</a><br>
<a href="book-Z-H-29.html#%_idx_5196">processing</a>, <a href="book-Z-H-29.html#%_idx_5316">[2]</a>,
<a href="book-Z-H-29.html#%_idx_5422">[3]</a>, <a href="book-Z-H-29.html#%_idx_5430">[4]</a>,
<a href="book-Z-H-29.html#%_idx_5436">[5]</a><br>
<a href="book-Z-H-34.html#%_idx_6080"><tt>compound-apply</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4446"><tt>compound-procedure?</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4554">computability</a>, <a href="book-Z-H-26.html#%_idx_4596">[2]</a><br>
<a href="book-Z-H-9.html#%_idx_8">computational process</a>,
<em>see also</em> process
<br>
<a href="book-Z-H-25.html#%_idx_4200">computer science</a>,
<a href="book-Z-H-26.html#%_idx_4558">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_498">mathematics vs.</a>,
<a href="book-Z-H-29.html#%_idx_5036">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1286">concrete data representation</a><br>
<a href="book-Z-H-23.html#%_idx_3578">concurrency</a><br>
<a href="book-Z-H-23.html#%_idx_3600">correctness of concurrent programs</a><br>
<a href="book-Z-H-23.html#%_idx_3694">deadlock</a><br>
<a href="book-Z-H-24.html#%_idx_4162">functional programming and</a><br>
<a href="book-Z-H-23.html#%_idx_3608">mechanisms for controlling</a><br>
<a href="book-Z-H-10.html#%_idx_352"><tt>cond</tt> (special form)</a><br>
<a href="book-Z-H-26.html#%_idx_4400">additional clause syntax</a><br>
<a href="book-Z-H-10.html#%_idx_364">clause</a><br>
<a href="book-Z-H-10.html#%_idx_384">evaluation of</a><br>
<a href="book-Z-H-10.html#%_idx_442"><tt>if</tt> vs.</a><br>
<a href="book-Z-H-20.html#%_idx_2880">implicit <tt>begin</tt> in consequent</a><br>
<a href="book-Z-H-26.html#%_idx_4370"><tt>cond->if</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4368"><tt>cond-actions</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4362"><tt>cond-clauses</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4364"><tt>cond-else-clause?</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4366"><tt>cond-predicate</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4360"><tt>cond?</tt></a><br>
conditional expression
<br>
<a href="book-Z-H-10.html#%_idx_356"><tt>cond</tt></a><br>
<a href="book-Z-H-10.html#%_idx_424"><tt>if</tt></a><br>
<a href="book-Z-H-11.html#%_idx_888">congruent modulo <em>n</em></a><br>
<a href="book-Z-H-29.html#%_idx_5320"><tt>conjoin</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3530"><tt>connect</tt></a>, <a href="book-Z-H-22.html#%_idx_3558">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3516">connector(s), in constraint system</a><br>
<a href="book-Z-H-22.html#%_idx_3520">operations on</a><br>
<a href="book-Z-H-22.html#%_idx_3544">representing</a><br>
<a href="book-Z-H-28.html#%_idx_4882">Conniver</a><br>
<a href="book-Z-H-14.html#%_idx_1320"><tt>cons</tt> (primitive procedure)</a><br>
<a href="book-Z-H-14.html#%_idx_1452">axiom for</a><br>
<a href="book-Z-H-15.html#%_idx_1534">closure property of</a><br>
<a href="book-Z-H-22.html#%_idx_3158">implemented with mutators</a><br>
<a href="book-Z-H-33.html#%_idx_5904">implemented with vectors</a><br>
<a href="book-Z-H-15.html#%_idx_1592">as list operation</a><br>
<a href="book-Z-H-14.html#%_idx_1332">meaning of the name</a><br>
<a href="book-Z-H-14.html#%_idx_1460">procedural implementation of</a>,
<a href="book-Z-H-14.html#%_idx_1468">[2]</a>, <a href="book-Z-H-22.html#%_idx_3160">[3]</a>,
<a href="book-Z-H-22.html#%_idx_3204">[4]</a>, <a href="book-Z-H-22.html#%_idx_3210">[5]</a>,
<a href="book-Z-H-27.html#%_idx_4774">[6]</a><br>
<a href="book-Z-H-15.html#%_idx_1628"><tt>cons</tt> up a list</a><br>
<a href="book-Z-H-24.html#%_idx_3738"><tt>cons-stream</tt> (special form)</a>,
<a href="book-Z-H-24.html#%_idx_3778">[2]</a><br>
<a href="book-Z-H-27.html#%_idx_4770">lazy evaluation and</a><br>
<a href="book-Z-H-24.html#%_idx_3784">why a special form</a><br>
<a href="book-Z-H-26.html#%_idx_4262">consciousness, expansion of</a><br>
consequent
<br>
<a href="book-Z-H-10.html#%_idx_388">of <tt>cond</tt> clause</a><br>
<a href="book-Z-H-10.html#%_idx_436">of <tt>if</tt></a><br>
<a href="book-Z-H-31.html#%_idx_5530"><tt>const</tt> (in register machine)</a><br>
<a href="book-Z-H-32.html#%_idx_5772">simulating</a><br>
<a href="book-Z-H-31.html#%_idx_5618">syntax of</a><br>
<a href="book-Z-H-22.html#%_idx_3540"><tt>constant</tt> (primitive constraint)</a><br>
<a href="book-Z-H-31.html#%_idx_5620">constant, specifying in register machine</a><br>
<a href="book-Z-H-32.html#%_idx_5780"><tt>constant-exp</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5782"><tt>constant-exp-value</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3514">constraint network</a><br>
constraint(s)
<br>
<a href="book-Z-H-22.html#%_idx_3512">primitive</a><br>
<a href="book-Z-H-22.html#%_idx_3484">propagation of</a><br>
<a href="book-Z-H-35.html#%_idx_6348"><tt>construct-arglist</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1292">constructor</a><br>
<a href="book-Z-H-14.html#%_idx_1382">as abstraction barrier</a><br>
<a href="book-Z-H-17.html#%_idx_2372"><tt>contents</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2562">using Scheme data types</a><br>
continuation
<br>
<a href="book-Z-H-28.html#%_idx_4984">in nondeterministic evaluator</a>,
<a href="book-Z-H-28.html#%_idx_5000">[2]</a>,
<em>see also</em> failure continuation; success continuation
<br>
<a href="book-Z-H-32.html#%_idx_5700">in register-machine simulator</a><br>
<a href="book-Z-H-31.html#%_idx_5554"><tt>continue</tt> register</a><br>
<a href="book-Z-H-34.html#%_idx_6024">in explicit-control evaluator</a><br>
<a href="book-Z-H-31.html#%_idx_5582">recursion and</a><br>
<a href="book-Z-H-12.html#%_idx_1138">continued fraction</a><br>
<a href="book-Z-H-12.html#%_idx_1146"><em>e</em> as</a><br>
<a href="book-Z-H-12.html#%_idx_1140">golden ratio as</a><br>
<a href="book-Z-H-12.html#%_idx_1152">tangent as</a><br>
<a href="book-Z-H-29.html#%_idx_5252">control structure</a><br>
<a href="book-Z-H-31.html#%_idx_5470">controller for register machine</a><br>
<a href="book-Z-H-31.html#%_idx_5488">controller diagram</a><br>
<a href="book-Z-H-13.html#%_idx_1268">conventional interface</a><br>
<a href="book-Z-H-15.html#%_idx_1720">sequence as</a><br>
<a href="book-Z-H-16.html#%_idx_2176">Cormen, Thomas H.</a><br>
<a href="book-Z-H-15.html#%_idx_1892"><tt>corner-split</tt></a><br>
<a href="book-Z-H-10.html#%_idx_500">correctness of a program</a><br>
<a href="book-Z-H-12.html#%_idx_1112"><tt>cos</tt> (primitive procedure)</a><br>
cosine
<br>
<a href="book-Z-H-12.html#%_idx_1104">fixed point of</a><br>
<a href="book-Z-H-24.html#%_idx_3916">power series for</a><br>
<a href="book-Z-H-11.html#%_idx_914">cosmic radiation</a><br>
<a href="book-Z-H-11.html#%_idx_730"><tt>count-change</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1682"><tt>count-leaves</tt></a>,
<a href="book-Z-H-15.html#%_idx_1690">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1792">as accumulation</a><br>
<a href="book-Z-H-33.html#%_idx_5924">as register machine</a><br>
<a href="book-Z-H-22.html#%_idx_3192"><tt>count-pairs</tt></a><br>
<a href="book-Z-H-11.html#%_idx_728">counting change</a>, <a href="book-Z-H-15.html#%_idx_1646">[2]</a><br>
<a href="book-Z-H-23.html#%_idx_3718">credit-card accounts, international</a><br>
<a href="book-Z-H-33.html#%_idx_5982">Cressey, David</a><br>
<a href="book-Z-H-18.html#%_idx_2574">cross-type operations</a><br>
<a href="book-Z-H-11.html#%_idx_920">cryptography</a><br>
<a href="book-Z-H-11.html#%_idx_788"><tt>cube</tt></a>, <a href="book-Z-H-12.html#%_idx_962">[2]</a>,
<a href="book-Z-H-12.html#%_idx_1194">[3]</a><br>
cube root
<br>
<a href="book-Z-H-12.html#%_idx_1172">as fixed point</a><br>
<a href="book-Z-H-10.html#%_idx_560">by Newton's method</a><br>
<a href="book-Z-H-12.html#%_idx_1176"><tt>cube-root</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3450">current time, for simulation agenda</a><br>
<a href="book-Z-H-22.html#%_idx_3422"><tt>current-time</tt></a>,
<a href="book-Z-H-22.html#%_idx_3458">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3170">cycle in list</a><br>
<a href="book-Z-H-22.html#%_idx_3194">detecting</a><p>
<p><p>
<br>
<a href="book-Z-H-24.html#%_idx_4170">Darlington, John</a><br>
<a href="book-Z-H-9.html#%_idx_12">data</a>, <a href="book-Z-H-10.html#%_idx_130">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1284">abstract</a>,
<em>see also</em> data abstraction
<br>
<a href="book-Z-H-14.html#%_idx_1424">abstract models for</a><br>
<a href="book-Z-H-14.html#%_idx_1440">algebraic specification for</a><br>
<a href="book-Z-H-13.html#%_idx_1258">compound</a><br>
<a href="book-Z-H-14.html#%_idx_1288">concrete representation of</a><br>
<a href="book-Z-H-15.html#%_idx_1540">hierarchical</a>,
<a href="book-Z-H-15.html#%_idx_1672">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1344">list-structured</a><br>
<a href="book-Z-H-14.html#%_idx_1414">meaning of</a><br>
mutable, <em>see</em> mutable data objects
<br>
<a href="book-Z-H-10.html#%_idx_134">numerical</a><br>
<a href="book-Z-H-14.html#%_idx_1446">procedural representation of</a><br>
<a href="book-Z-H-26.html#%_idx_4542">as program</a><br>
<a href="book-Z-H-22.html#%_idx_3176">shared</a><br>
<a href="book-Z-H-16.html#%_idx_1984">symbolic</a><br>
<a href="book-Z-H-17.html#%_idx_2360">tagged</a>, <a href="book-Z-H-33.html#%_idx_5866">[2]</a><br>
<a href="book-Z-H-13.html#%_idx_1262">data abstraction</a>,
<a href="book-Z-H-14.html#%_idx_1280">[2]</a>, <a href="book-Z-H-17.html#%_idx_2288">[3]</a>,
<a href="book-Z-H-17.html#%_idx_2310">[4]</a>, <a href="book-Z-H-26.html#%_idx_4280">[5]</a>,
<em>see also</em> metacircular evaluator
<br>
<a href="book-Z-H-22.html#%_idx_3228">for queue</a><br>
data base
<br>
<a href="book-Z-H-17.html#%_idx_2482">data-directed programming and</a><br>
<a href="book-Z-H-29.html#%_idx_5190">indexing</a>, <a href="book-Z-H-29.html#%_idx_5374">[2]</a><br>
<a href="book-Z-H-17.html#%_idx_2484">Insatiable Enterprises personnel</a><br>
<a href="book-Z-H-29.html#%_idx_5098">logic programming and</a><br>
<a href="book-Z-H-29.html#%_idx_5106">Microshaft personnel</a><br>
<a href="book-Z-H-16.html#%_idx_2202">as set of records</a><br>
<a href="book-Z-H-31.html#%_idx_5468">data paths for register machine</a><br>
<a href="book-Z-H-31.html#%_idx_5478">data-path diagram</a><br>
data types
<br>
<a href="book-Z-H-18.html#%_idx_2552">in Lisp</a><br>
<a href="book-Z-H-24.html#%_idx_4098">in strongly typed languages</a><br>
<a href="book-Z-H-17.html#%_idx_2298">data-directed programming</a>,
<a href="book-Z-H-17.html#%_idx_2424">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4244">case analysis vs.</a><br>
<a href="book-Z-H-26.html#%_idx_4388">in metacircular evaluator</a><br>
<a href="book-Z-H-29.html#%_idx_5308">in query interpreter</a><br>
<a href="book-Z-H-18.html#%_idx_2720">data-directed recursion</a><br>
<a href="book-Z-H-23.html#%_idx_3696">deadlock</a><br>
<a href="book-Z-H-23.html#%_idx_3698">avoidance</a><br>
<a href="book-Z-H-23.html#%_idx_3700">recovery</a><br>
<a href="book-Z-H-9.html#%_idx_22">debug</a><br>
<a href="book-Z-H-10.html#%_idx_542">decimal point in numbers</a><br>
<a href="book-Z-H-10.html#%_idx_492">declarative vs. imperative knowledge</a>,
<a href="book-Z-H-29.html#%_idx_5030">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5070">logic programming and</a>,
<a href="book-Z-H-29.html#%_idx_5256">[2]</a><br>
<a href="book-Z-H-28.html#%_idx_4816">nondeterministic computing and</a><br>
<a href="book-Z-H-16.html#%_idx_2272"><tt>decode</tt></a><br>
<a href="book-Z-H-10.html#%_idx_568">decomposition of program into parts</a><br>
<a href="book-Z-H-26.html#%_idx_4488">deep binding</a><br>
<a href="book-Z-H-15.html#%_idx_1692"><tt>deep-reverse</tt></a><br>
<a href="book-Z-H-11.html#%_idx_652">deferred operations</a><br>
<a href="book-Z-H-10.html#%_idx_224"><tt>define</tt> (special form)</a><br>
<a href="book-Z-H-15.html#%_idx_1650">with dotted-tail notation</a><br>
<a href="book-Z-H-21.html#%_idx_3078">environment model of</a><br>
<a href="book-Z-H-12.html#%_idx_1042"><tt>lambda</tt> vs.</a><br>
<a href="book-Z-H-10.html#%_idx_306">for procedures</a>,
<a href="book-Z-H-12.html#%_idx_1046">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4300">syntactic sugar</a><br>
<a href="book-Z-H-10.html#%_idx_228">value of</a><br>
<a href="book-Z-H-10.html#%_idx_270">why a special form</a><br>
<tt>define</tt> (special form)
<br>
internal, <em>see</em> internal definition
<br>
<a href="book-Z-H-26.html#%_idx_4460"><tt>define-variable!</tt></a>,
<a href="book-Z-H-26.html#%_idx_4484">[2]</a><br>
<a href="book-Z-H-12.html#%_idx_1002">definite integral</a><br>
<a href="book-Z-H-20.html#%_idx_2960">estimated with Monte Carlo simulation</a>, <a href="book-Z-H-24.html#%_idx_4142">[2]</a><br>
definition, <em>see</em> <tt>define</tt>; internal definition
<br>
<a href="book-Z-H-26.html#%_idx_4306"><tt>definition-value</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4304"><tt>definition-variable</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4302"><tt>definition?</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4898">deKleer, Johan</a>, <a href="book-Z-H-29.html#%_idx_5264">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3768"><tt>delay</tt> (special form)</a><br>
<a href="book-Z-H-24.html#%_idx_4072">explicit</a><br>
<a href="book-Z-H-27.html#%_idx_4798">explicit vs. automatic</a><br>
<a href="book-Z-H-24.html#%_idx_3796">implementation using <tt>lambda</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4768">lazy evaluation and</a><br>
<a href="book-Z-H-24.html#%_idx_3800">memoized</a>, <a href="book-Z-H-24.html#%_idx_3900">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3786">why a special form</a><br>
<a href="book-Z-H-22.html#%_idx_3342">delay, in digital circuit</a><br>
<a href="book-Z-H-27.html#%_idx_4742"><tt>delay-it</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4068">delayed argument</a><br>
<a href="book-Z-H-19.html#%_idx_2834">delayed evaluation</a>,
<a href="book-Z-H-24.html#%_idx_3730">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3830">assignment and</a><br>
<a href="book-Z-H-27.html#%_idx_4800">explicit vs. automatic</a><br>
<a href="book-Z-H-27.html#%_idx_4668">in lazy evaluator</a><br>
<a href="book-Z-H-24.html#%_idx_4094">normal-order evaluation and</a><br>
<a href="book-Z-H-24.html#%_idx_3826">printing and</a><br>
<a href="book-Z-H-24.html#%_idx_4056">streams and</a><br>
<a href="book-Z-H-24.html#%_idx_3772">delayed object</a><br>
<a href="book-Z-H-22.html#%_idx_3240"><tt>delete-queue!</tt></a>,
<a href="book-Z-H-22.html#%_idx_3258">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1304"><tt>denom</tt></a>, <a href="book-Z-H-14.html#%_idx_1352">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1420">axiom for</a><br>
<a href="book-Z-H-14.html#%_idx_1394">reducing to lowest terms</a><br>
<a href="book-Z-H-18.html#%_idx_2726">dense polynomial</a><br>
<a href="book-Z-H-28.html#%_idx_4888">dependency-directed backtracking</a><br>
<a href="book-Z-H-23.html#%_idx_3632"><tt>deposit</tt> , with external serializer</a><br>
<a href="book-Z-H-20.html#%_idx_2898"><tt>deposit</tt> message for bank account</a><br>
<a href="book-Z-H-28.html#%_idx_4854">depth-first search</a><br>
<a href="book-Z-H-22.html#%_idx_3266">deque</a><br>
<a href="book-Z-H-12.html#%_idx_1192"><tt>deriv</tt> (numerical)</a><br>
<a href="book-Z-H-16.html#%_idx_2056"><tt>deriv</tt> (symbolic)</a><br>
<a href="book-Z-H-17.html#%_idx_2480">data-directed</a><br>
<a href="book-Z-H-12.html#%_idx_1186">derivative of a function</a><br>
<a href="book-Z-H-26.html#%_idx_4356">derived expressions in evaluator</a><br>
<a href="book-Z-H-34.html#%_idx_6116">adding to explicit-control evaluator</a><br>
<a href="book-Z-H-15.html#%_idx_1980">design, stratified</a><br>
<a href="book-Z-H-24.html#%_idx_4062">differential equation</a>,
<em>see also</em> <tt>solve</tt>
<br>
<a href="book-Z-H-24.html#%_idx_4082">second-order</a>,
<a href="book-Z-H-24.html#%_idx_4084">[2]</a><br>
differentiation
<br>
<a href="book-Z-H-12.html#%_idx_1190">numerical</a><br>
<a href="book-Z-H-16.html#%_idx_2048">rules for</a>, <a href="book-Z-H-16.html#%_idx_2094">[2]</a><br>
<a href="book-Z-H-16.html#%_idx_2042">symbolic</a>, <a href="book-Z-H-17.html#%_idx_2478">[2]</a><br>
<a href="book-Z-H-23.html#%_idx_3606">diffusion, simulation of</a><br>
<a href="book-Z-H-22.html#%_idx_3338">digital signal</a><br>
<a href="book-Z-H-22.html#%_idx_3328">digital-circuit simulation</a><br>
<a href="book-Z-H-22.html#%_idx_3410">agenda</a><br>
<a href="book-Z-H-22.html#%_idx_3436">agenda implementation</a><br>
<a href="book-Z-H-22.html#%_idx_3368">primitive function boxes</a><br>
<a href="book-Z-H-22.html#%_idx_3392">representing wires</a><br>
<a href="book-Z-H-22.html#%_idx_3428">sample simulation</a><br>
<a href="book-Z-H-23.html#%_idx_3658">Dijkstra, Edsger Wybe</a><br>
<a href="book-Z-H-28.html#%_idx_4932">Dinesman, Howard P.</a><br>
<a href="book-Z-H-11.html#%_idx_882">Diophantus's <em>Arithmetic</em>, Fermat's copy of</a><br>
<a href="book-Z-H-29.html#%_idx_5324"><tt>disjoin</tt></a><br>
dispatching
<br>
<a href="book-Z-H-17.html#%_idx_2494">comparing different styles</a><br>
<a href="book-Z-H-17.html#%_idx_2430">on type</a>,
<em>see also</em> data-directed programming
<br>
<a href="book-Z-H-11.html#%_idx_940"><tt>display</tt> (primitive procedure)</a>,
<a href="book-Z-H-14.html#%_idx_1358">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3766"><tt>display-line</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3764"><tt>display-stream</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4934"><tt>distinct?</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2510"><tt>div</tt> (generic)</a><br>
<a href="book-Z-H-17.html#%_idx_2318"><tt>div-complex</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1500"><tt>div-interval</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1512">division by zero</a><br>
<a href="book-Z-H-18.html#%_idx_2760"><tt>div-poly</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1314"><tt>div-rat</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3938"><tt>div-series</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2762"><tt>div-terms</tt></a><br>
<a href="book-Z-H-11.html#%_idx_864"><tt>divides?</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3838"><tt>divisible?</tt></a><br>
<a href="book-Z-H-10.html#%_idx_532">division of integers</a><br>
<a href="book-Z-H-23.html#%_idx_3690">dog, perfectly rational, behavior of</a><br>
<a href="book-Z-H-34.html#%_idx_6190">DOS/Windows</a><br>
<a href="book-Z-H-15.html#%_idx_1802"><tt>dot-product</tt></a><br>
dotted-tail notation
<br>
<a href="book-Z-H-15.html#%_idx_1648">for procedure parameters</a>,
<a href="book-Z-H-17.html#%_idx_2456">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5116">in query pattern</a>,
<a href="book-Z-H-29.html#%_idx_5350">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5162">in query-language rule</a><br>
<a href="book-Z-H-29.html#%_idx_5354"><tt>read</tt> and</a><br>
<a href="book-Z-H-28.html#%_idx_4890">Doyle, Jon</a><br>
<a href="book-Z-H-15.html#%_idx_1948"><tt>draw-line</tt></a><br>
driver loop
<br>
<a href="book-Z-H-34.html#%_idx_6136">in explicit-control evaluator</a><br>
<a href="book-Z-H-27.html#%_idx_4732">in lazy evaluator</a><br>
<a href="book-Z-H-26.html#%_idx_4518">in metacircular evaluator</a><br>
<a href="book-Z-H-28.html#%_idx_4908">in nondeterministic evaluator</a>,
<a href="book-Z-H-28.html#%_idx_5018">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5232">in query interpreter</a>,
<a href="book-Z-H-29.html#%_idx_5288">[2]</a><br>
<tt>driver-loop</tt>
<br>
<a href="book-Z-H-27.html#%_idx_4736">for lazy evaluator</a><br>
<a href="book-Z-H-26.html#%_idx_4532">for metacircular evaluator</a><br>
<a href="book-Z-H-28.html#%_idx_5024">for nondeterministic evaluator</a><p>
<p><p>
<br>
<em>e</em>
<br>
<a href="book-Z-H-12.html#%_idx_1148">as continued fraction</a><br>
<a href="book-Z-H-24.html#%_idx_4078">as solution to differential equation</a><br>
<a href="book-Z-H-24.html#%_idx_3914"><em>e</em><sup><em>x</em></sup>, power series for</a><br>
<a href="book-Z-H-24.html#%_idx_3848">Earth, measuring circumference of</a><br>
<a href="book-Z-H-15.html#%_idx_1918"><tt>edge1-frame</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1920"><tt>edge2-frame</tt></a><br>
efficiency, <em>see also</em> order of growth,
<em>see also</em> order of growth
<br>
<a href="book-Z-H-35.html#%_idx_6230">of compilation</a><br>
<a href="book-Z-H-29.html#%_idx_5188">of data-base access</a><br>
<a href="book-Z-H-26.html#%_idx_4642">of evaluation</a><br>
<a href="book-Z-H-9.html#%_idx_100">of Lisp</a><br>
<a href="book-Z-H-29.html#%_idx_5202">of query processing</a><br>
<a href="book-Z-H-11.html#%_idx_732">of tree-recursive process</a><br>
<a href="book-Z-H-23.html#%_idx_3716">EIEIO</a><br>
<a href="book-Z-H-15.html#%_idx_1846">eight-queens puzzle</a>,
<a href="book-Z-H-28.html#%_idx_4946">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_4032">electrical circuits, modeled with streams</a>, <a href="book-Z-H-24.html#%_idx_4090">[2]</a><br>
<a href="book-Z-H-16.html#%_idx_2104"><tt>element-of-set?</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2160">binary-tree representation</a><br>
<a href="book-Z-H-16.html#%_idx_2128">ordered-list representation</a><br>
<a href="book-Z-H-16.html#%_idx_2116">unordered-list representation</a><br>
<a href="book-Z-H-10.html#%_idx_416"><tt>else</tt> (special symbol in <tt>cond</tt>)</a><br>
<a href="book-Z-H-27.html#%_idx_4672">embedded language, language design using</a><br>
<a href="book-Z-H-15.html#%_idx_1594">empty list</a><br>
<a href="book-Z-H-16.html#%_idx_2018">denoted as <tt>'()</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1618">recognizing with <tt>null?</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3744">empty stream</a><br>
<a href="book-Z-H-22.html#%_idx_3414"><tt>empty-agenda?</tt></a>,
<a href="book-Z-H-22.html#%_idx_3470">[2]</a><br>
<a href="book-Z-H-34.html#%_idx_6060"><tt>empty-arglist</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6268"><tt>empty-instruction-sequence</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3234"><tt>empty-queue?</tt></a>,
<a href="book-Z-H-22.html#%_idx_3250">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2696"><tt>empty-termlist?</tt></a>,
<a href="book-Z-H-18.html#%_idx_2742">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2886">encapsulated name</a><br>