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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
|
<html>
<head><title>ACL2 Version 3.1</title></head>
<body text=#000000 bgcolor="#FFFFFF">
<h1>Index</h1>
This index lists all documented topics in ACL2, arranged into sections. The first section is devoted to those whose names begin with signs (and digits), such as *STANDARD-CI* and 1+. Thereafter we have one section for each of the 26 letters of the alphabet. The last section is devoted to those topics in the ACL2-PC package. By clicking on the appropriate entry of the line below you can go to the corresponding section of the index.
You may use Find to search the Index.
We also provide an index based on <a href="acl2-doc-major-topics.html">Major Topics</a>.
<pre>
<A HREF="#Signs">Signs</A> <A HREF="#A">A</A> <A HREF="#B">B</A> <A HREF="#C">C</A> <A HREF="#D">D</A> <A HREF="#E">E</A> <A HREF="#F">F</A> <A HREF="#G">G</A> <A HREF="#H">H</A> <A HREF="#I">I</A> J <A HREF="#K">K</A> <A HREF="#L">L</A> <A HREF="#M">M</A> <A HREF="#N">N</A> <A HREF="#O">O</A> <A HREF="#P">P</A> <A HREF="#Q">Q</A> <A HREF="#R">R</A> <A HREF="#S">S</A> <A HREF="#T">T</A> <A HREF="#U">U</A> <A HREF="#V">V</A> <A HREF="#W">W</A> <A HREF="#X">X</A> <A HREF="#Y">Y</A> <A HREF="#Z">Z</A> <A HREF="#ACL2-PC::">ACL2-PC::</A>
</pre>
<BR><BR><H1><A NAME="Signs">Signs</A></H1>
<b><a href="_star_.html">*</a> -- multiplication macro
</b><br><br>
<b><a href="_star_STANDARD-CI_star_.html">*STANDARD-CI*</a> -- an ACL2 character-based analogue of CLTL's <code>*standard-input*</code>
</b><br><br>
<b><a href="_star_STANDARD-CO_star_.html">*STANDARD-CO*</a> -- the ACL2 analogue of CLTL's <code>*standard-output*</code>
</b><br><br>
<b><a href="_star_STANDARD-OI_star_.html">*STANDARD-OI*</a> -- an ACL2 object-based analogue of CLTL's <code>*standard-input*</code>
</b><br><br>
<b><a href="_star_TERMINAL-MARKUP-TABLE_star_.html">*TERMINAL-MARKUP-TABLE*</a> -- a <a href="MARKUP.html">markup</a> table used for printing to the terminal
</b><br><br>
<b><a href="+.html">+</a> -- addition macro
</b><br><br>
<b><a href="_hyphen_.html">-</a> -- macro for subtraction and negation
</b><br><br>
<b><a href="_slash_.html">/</a> -- macro for division and reciprocal
</b><br><br>
<b><a href="_slash_=.html">/=</a> -- test inequality of two numbers
</b><br><br>
<b><a href="1+.html">1+</a> -- increment by 1
</b><br><br>
<b><a href="1-.html">1-</a> -- decrement by 1
</b><br><br>
<b><a href="_lt_.html"><</a> -- less-than
</b><br><br>
<b><a href="_lt_=.html"><=</a> -- less-than-or-equal test
</b><br><br>
<b><a href="=.html">=</a> -- test equality of two numbers
</b><br><br>
<b><a href="_gt_.html">></a> -- greater-than test
</b><br><br>
<b><a href="_gt_=.html">>=</a> -- greater-than-or-equal test
</b><br><br>
<b><a href="_at_.html">@</a> -- get the value of a global variable in <code><a href="STATE.html">state</a></code>
</b><br><br>
<BR><BR><H1><A NAME="A">A</A></H1>
<b><a href="A_Flying_Tour_of_ACL2.html">A Flying Tour of ACL2</a> -- A Flying Tour of ACL2
</b><br><br>
<b><a href="A_Sketch_of_How_the_Rewriter_Works.html">A Sketch of How the Rewriter Works</a> -- A Sketch of How the Rewriter Works
</b><br><br>
<b><a href="A_Tiny_Warning_Sign.html">A Tiny Warning Sign</a> -- A Tiny Warning Sign
</b><br><br>
<b><a href="A_Trivial_Proof.html">A Trivial Proof</a> -- A Trivial Proof
</b><br><br>
<b><a href="A_Typical_State.html">A Typical State</a> -- A Typical State
</b><br><br>
<b><a href="A_Walking_Tour_of_ACL2.html">A Walking Tour of ACL2</a> -- A Walking Tour of ACL2
</b><br><br>
<b><a href="ABORT_bang_.html">ABORT!</a> -- to return to the top-level of ACL2's command loop
</b><br><br>
<b><a href="ABS.html">ABS</a> -- the absolute value of a real number
</b><br><br>
<b><a href="ACCUMULATED-PERSISTENCE.html">ACCUMULATED-PERSISTENCE</a> -- to get statistics on which <a href="RUNE.html">rune</a>s are being tried
</b><br><br>
<b><a href="ACKNOWLEDGMENTS.html">ACKNOWLEDGMENTS</a> -- some contributors to the well-being of ACL2
</b><br><br>
<b><a href="ACL2_Characters.html">ACL2 Characters</a> -- ACL2 Characters
</b><br><br>
<b><a href="ACL2_Conses_or_Ordered_Pairs.html">ACL2 Conses or Ordered Pairs</a> -- ACL2 Conses or Ordered Pairs
</b><br><br>
<b><a href="ACL2_Strings.html">ACL2 Strings</a> -- ACL2 Strings
</b><br><br>
<b><a href="ACL2_Symbols.html">ACL2 Symbols</a> -- ACL2 Symbols
</b><br><br>
<b><a href="ACL2_System_Architecture.html">ACL2 System Architecture</a> -- ACL2 System Architecture
</b><br><br>
<b><a href="ACL2_as_an_Interactive_Theorem_Prover.html">ACL2 as an Interactive Theorem Prover</a> -- ACL2 as an Interactive Theorem Prover
</b><br><br>
<b><a href="ACL2_as_an_Interactive_Theorem_Prover__lparen_cont_rparen_.html">ACL2 as an Interactive Theorem Prover (cont)</a> -- ACL2 as an Interactive Theorem Prover (cont)
</b><br><br>
<b><a href="ACL2_is_an_Untyped_Language.html">ACL2 is an Untyped Language</a> -- ACL2 is an Untyped Language
</b><br><br>
<b><a href="ACL2-COUNT.html">ACL2-COUNT</a> -- a commonly used measure for justifying recursion
</b><br><br>
<b><a href="ACL2-CUSTOMIZATION.html">ACL2-CUSTOMIZATION</a> -- file of initial commands for ACL2 to run at <a href="STARTUP.html">startup</a>
</b><br><br>
<b><a href="ACL2-DEFAULTS-TABLE.html">ACL2-DEFAULTS-TABLE</a> -- a <a href="TABLE.html">table</a> specifying certain defaults, e.g., the default <a href="DEFUN-MODE.html">defun-mode</a>
</b><br><br>
<b><a href="ACL2-HELP.html">ACL2-HELP</a> -- the acl2-help mailing list
</b><br><br>
<b><a href="ACL2-NUMBERP.html">ACL2-NUMBERP</a> -- recognizer for numbers
</b><br><br>
<b><a href="ACL2-TUTORIAL.html">ACL2-TUTORIAL</a> -- tutorial introduction to ACL2
</b><br><br>
<b><a href="ACL2-USER.html">ACL2-USER</a> -- a package the ACL2 user may prefer
</b><br><br>
<b><a href="ACONS.html">ACONS</a> -- constructor for association lists
</b><br><br>
<b><a href="ACTIVE-RUNEP.html">ACTIVE-RUNEP</a> -- check that a <a href="RUNE.html">rune</a> exists and is <a href="ENABLE.html">enable</a>d
</b><br><br>
<b><a href="ADD-BINOP.html">ADD-BINOP</a> -- associate a binary function name with a macro name
</b><br><br>
<b><a href="ADD-DEFAULT-HINTS.html">ADD-DEFAULT-HINTS</a> -- add to the default hints
</b><br><br>
<b><a href="ADD-DEFAULT-HINTS_bang_.html">ADD-DEFAULT-HINTS!</a> -- add to the default hints non-<code><a href="LOCAL.html">local</a></code>ly
</b><br><br>
<b><a href="ADD-DIVE-INTO-MACRO.html">ADD-DIVE-INTO-MACRO</a> -- associate <a href="PROOF-CHECKER.html">proof-checker</a> diving function with macro name
</b><br><br>
<b><a href="ADD-INCLUDE-BOOK-DIR.html">ADD-INCLUDE-BOOK-DIR</a> -- associate directory to keyword for <code><a href="INCLUDE-BOOK.html">include-book</a></code>'s <code>:dir</code> argument
</b><br><br>
<b><a href="ADD-INVISIBLE-FNS.html">ADD-INVISIBLE-FNS</a> -- make some unary functions invisible to the <a href="LOOP-STOPPER.html">loop-stopper</a> algorithm
</b><br><br>
<b><a href="ADD-MACRO-ALIAS.html">ADD-MACRO-ALIAS</a> -- associate a function name with a macro name
</b><br><br>
<b><a href="ADD-MATCH-FREE-OVERRIDE.html">ADD-MATCH-FREE-OVERRIDE</a> -- set <code>:match-free</code> value to <code>:once</code> or <code>:all</code> in existing rules
</b><br><br>
<b><a href="ADD-NTH-ALIAS.html">ADD-NTH-ALIAS</a> -- associate one symbol with another for printing of <code><a href="NTH.html">nth</a></code>/<code><a href="UPDATE-NTH.html">update-nth</a></code> terms
</b><br><br>
<b><a href="ADD-RAW-ARITY.html">ADD-RAW-ARITY</a> -- add arity information for raw mode
</b><br><br>
<b><a href="ADD-TO-SET-EQ.html">ADD-TO-SET-EQ</a> -- add a symbol to a list
</b><br><br>
<b><a href="ADD-TO-SET-EQL.html">ADD-TO-SET-EQL</a> -- add an object to a list
</b><br><br>
<b><a href="ADD-TO-SET-EQUAL.html">ADD-TO-SET-EQUAL</a> -- add an object to a list
</b><br><br>
<b><a href="ALISTP.html">ALISTP</a> -- recognizer for association lists
</b><br><br>
<b><a href="ALLOCATE-FIXNUM-RANGE.html">ALLOCATE-FIXNUM-RANGE</a> -- set aside fixnums in GCL
</b><br><br>
<b><a href="ALPHA-CHAR-P.html">ALPHA-CHAR-P</a> -- recognizer for alphabetic characters
</b><br><br>
<b><a href="ALPHORDER.html">ALPHORDER</a> -- total order on atoms
</b><br><br>
<b><a href="AND.html">AND</a> -- conjunction
</b><br><br>
<b><a href="APPEND.html">APPEND</a> -- <a href="CONCATENATE.html">concatenate</a> two or more lists
</b><br><br>
<b><a href="APROPOS.html">APROPOS</a> -- searching <code>:</code><code><a href="DOC.html">doc</a></code> and <code>:</code><code><a href="MORE-DOC.html">more-doc</a></code> text
</b><br><br>
<b><a href="AREF1.html">AREF1</a> -- access the elements of a 1-dimensional array
</b><br><br>
<b><a href="AREF2.html">AREF2</a> -- access the elements of a 2-dimensional array
</b><br><br>
<b><a href="ARGS.html">ARGS</a> -- <code>args</code>, <code><a href="GUARD.html">guard</a></code>, <code>type</code>, <code><a href="CONSTRAINT.html">constraint</a></code>, etc., of a function symbol
</b><br><br>
<b><a href="ARRAY1P.html">ARRAY1P</a> -- recognize a 1-dimensional array
</b><br><br>
<b><a href="ARRAY2P.html">ARRAY2P</a> -- recognize a 2-dimensional array
</b><br><br>
<b><a href="ARRAYS.html">ARRAYS</a> -- an introduction to ACL2 arrays
</b><br><br>
<b><a href="ARRAYS-EXAMPLE.html">ARRAYS-EXAMPLE</a> -- an example illustrating ACL2 arrays
</b><br><br>
<b><a href="ASET1.html">ASET1</a> -- set the elements of a 1-dimensional array
</b><br><br>
<b><a href="ASET2.html">ASET2</a> -- set the elements of a 2-dimensional array
</b><br><br>
<b><a href="ASH.html">ASH</a> -- arithmetic shift operation
</b><br><br>
<b><a href="ASSERT$.html">ASSERT$</a> -- cause a hard error if the given test is false
</b><br><br>
<b><a href="ASSERT-EVENT.html">ASSERT-EVENT</a> -- assert that a given form returns a non-<code>nil</code> value
</b><br><br>
<b><a href="ASSIGN.html">ASSIGN</a> -- assign to a global variable in <code><a href="STATE.html">state</a></code>
</b><br><br>
<b><a href="ASSOC.html">ASSOC</a> -- look up key in association list, using <code><a href="EQL.html">eql</a></code> as test
</b><br><br>
<b><a href="ASSOC-EQ.html">ASSOC-EQ</a> -- look up key in association list, using <code><a href="EQ.html">eq</a></code> as test
</b><br><br>
<b><a href="ASSOC-EQUAL.html">ASSOC-EQUAL</a> -- look up key in association list
</b><br><br>
<b><a href="ASSOC-KEYWORD.html">ASSOC-KEYWORD</a> -- look up key in a <code><a href="KEYWORD-VALUE-LISTP.html">keyword-value-listp</a></code>
</b><br><br>
<b><a href="ASSOC-STRING-EQUAL.html">ASSOC-STRING-EQUAL</a> -- look up key, a string, in association list
</b><br><br>
<b><a href="ATOM.html">ATOM</a> -- recognizer for atoms
</b><br><br>
<b><a href="ATOM-LISTP.html">ATOM-LISTP</a> -- recognizer for a true list of <a href="ATOM.html">atom</a>s
</b><br><br>
<b><a href="About_Models.html">About Models</a> -- About Models
</b><br><br>
<b><a href="About_Types.html">About Types</a> -- About Types
</b><br><br>
<b><a href="About_the_ACL2_Home_Page.html">About the ACL2 Home Page</a> -- About the ACL2 Home Page
</b><br><br>
<b><a href="About_the_Admission_of_Recursive_Definitions.html">About the Admission of Recursive Definitions</a> -- About the Admission of Recursive Definitions
</b><br><br>
<b><a href="About_the_Prompt.html">About the Prompt</a> -- About the Prompt
</b><br><br>
<b><a href="An_Example_Common_Lisp_Function_Definition.html">An Example Common Lisp Function Definition</a> -- An Example Common Lisp Function Definition
</b><br><br>
<b><a href="An_Example_of_ACL2_in_Use.html">An Example of ACL2 in Use</a> -- An Example of ACL2 in Use
</b><br><br>
<b><a href="Analyzing_Common_Lisp_Models.html">Analyzing Common Lisp Models</a> -- Analyzing Common Lisp Models
</b><br><br>
<BR><BR><H1><A NAME="B">B</A></H1>
<b><a href="BACKCHAIN-LIMIT.html">BACKCHAIN-LIMIT</a> -- limiting the effort expended on relieving hypotheses
</b><br><br>
<b><a href="BDD.html">BDD</a> -- ordered binary decision diagrams with rewriting
</b><br><br>
<b><a href="BDD-ALGORITHM.html">BDD-ALGORITHM</a> -- summary of the BDD algorithm in ACL2
</b><br><br>
<b><a href="BDD-INTRODUCTION.html">BDD-INTRODUCTION</a> -- examples illustrating the use of BDDs in ACL2
</b><br><br>
<b><a href="BIBLIOGRAPHY.html">BIBLIOGRAPHY</a> -- reports about ACL2
</b><br><br>
<b><a href="BINARY-_star_.html">BINARY-*</a> -- multiplication function
</b><br><br>
<b><a href="BINARY-+.html">BINARY-+</a> -- addition function
</b><br><br>
<b><a href="BINARY-APPEND.html">BINARY-APPEND</a> -- <a href="CONCATENATE.html">concatenate</a> two lists
</b><br><br>
<b><a href="BIND-FREE.html">BIND-FREE</a> -- to bind free variables of a rewrite or linear rule
</b><br><br>
<b><a href="BIND-FREE-EXAMPLES.html">BIND-FREE-EXAMPLES</a> -- examples pertaining to <code><a href="BIND-FREE.html">bind-free</a></code> hypotheses
</b><br><br>
<b><a href="BINOP-TABLE.html">BINOP-TABLE</a> -- associates binary function with the corresponding macro
</b><br><br>
<b><a href="BOOK-CONTENTS.html">BOOK-CONTENTS</a> -- restrictions on the forms inside <a href="BOOKS.html">books</a>
</b><br><br>
<b><a href="BOOK-EXAMPLE.html">BOOK-EXAMPLE</a> -- how to create, certify, and use a simple book
</b><br><br>
<b><a href="BOOK-MAKEFILES.html">BOOK-MAKEFILES</a> -- makefile support provided with the ACL2 distribution
</b><br><br>
<b><a href="BOOK-NAME.html">BOOK-NAME</a> -- conventions associated with book names
</b><br><br>
<b><a href="BOOKS.html">BOOKS</a> -- files of ACL2 event forms
</b><br><br>
<b><a href="BOOLEANP.html">BOOLEANP</a> -- recognizer for booleans
</b><br><br>
<b><a href="BREAK-LEMMA.html">BREAK-LEMMA</a> -- a quick introduction to breaking rewrite rules in ACL2
</b><br><br>
<b><a href="BREAK-ON-ERROR.html">BREAK-ON-ERROR</a> -- break when encountering a hard or soft error caused by ACL2.
</b><br><br>
<b><a href="BREAK-REWRITE.html">BREAK-REWRITE</a> -- the read-eval-print loop entered to <a href="MONITOR.html">monitor</a> rewrite rules
</b><br><br>
<b><a href="BREAKS.html">BREAKS</a> -- Common Lisp breaks
</b><br><br>
<b><a href="BRR.html">BRR</a> -- to enable or disable the breaking of rewrite rules
</b><br><br>
<b><a href="BRR-COMMANDS.html">BRR-COMMANDS</a> -- <a href="BREAK-REWRITE.html">Break-Rewrite</a> Commands
</b><br><br>
<b><a href="BRR_at_.html">BRR@</a> -- to access context sensitive information within <code><a href="BREAK-REWRITE.html">break-rewrite</a></code>
</b><br><br>
<b><a href="BUILT-IN-CLAUSES.html">BUILT-IN-CLAUSES</a> -- to build a clause into the simplifier
</b><br><br>
<b><a href="BUTLAST.html">BUTLAST</a> -- all but a final segment of a list
</b><br><br>
<b><a href="BY.html">BY</a> -- hints keyword <code>:BY</code>
</b><br><br>
<BR><BR><H1><A NAME="C">C</A></H1>
<b><a href="CAAAAR.html">CAAAAR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CAAAR.html">caaar</a></code>
</b><br><br>
<b><a href="CAAADR.html">CAAADR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CAADR.html">caadr</a></code>
</b><br><br>
<b><a href="CAAAR.html">CAAAR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CAAR.html">caar</a></code>
</b><br><br>
<b><a href="CAADAR.html">CAADAR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CADAR.html">cadar</a></code>
</b><br><br>
<b><a href="CAADDR.html">CAADDR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CADDR.html">caddr</a></code>
</b><br><br>
<b><a href="CAADR.html">CAADR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CADR.html">cadr</a></code>
</b><br><br>
<b><a href="CAAR.html">CAAR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CAR.html">car</a></code>
</b><br><br>
<b><a href="CADAAR.html">CADAAR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CDAAR.html">cdaar</a></code>
</b><br><br>
<b><a href="CADADR.html">CADADR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CDADR.html">cdadr</a></code>
</b><br><br>
<b><a href="CADAR.html">CADAR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CDAR.html">cdar</a></code>
</b><br><br>
<b><a href="CADDAR.html">CADDAR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CDDAR.html">cddar</a></code>
</b><br><br>
<b><a href="CADDDR.html">CADDDR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CDDDR.html">cdddr</a></code>
</b><br><br>
<b><a href="CADDR.html">CADDR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CDDR.html">cddr</a></code>
</b><br><br>
<b><a href="CADR.html">CADR</a> -- <code><a href="CAR.html">car</a></code> of the <code><a href="CDR.html">cdr</a></code>
</b><br><br>
<b><a href="CAR.html">CAR</a> -- returns the first element of a non-empty list, else <code>nil</code>
</b><br><br>
<b><a href="CASE.html">CASE</a> -- conditional based on if-then-else using <code><a href="EQL.html">eql</a></code>
</b><br><br>
<b><a href="CASE-MATCH.html">CASE-MATCH</a> -- pattern matching or destructuring
</b><br><br>
<b><a href="CASE-SPLIT.html">CASE-SPLIT</a> -- like force but immediately splits the top-level goal on the hypothesis
</b><br><br>
<b><a href="CASE-SPLIT-LIMITATIONS.html">CASE-SPLIT-LIMITATIONS</a> -- a list of two ``numbers'' limiting the number of cases produced at once
</b><br><br>
<b><a href="CASES.html">CASES</a> -- hints keyword <code>:CASES</code>
</b><br><br>
<b><a href="CBD.html">CBD</a> -- connected book directory string
</b><br><br>
<b><a href="CDAAAR.html">CDAAAR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CAAAR.html">caaar</a></code>
</b><br><br>
<b><a href="CDAADR.html">CDAADR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CAADR.html">caadr</a></code>
</b><br><br>
<b><a href="CDAAR.html">CDAAR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CAAR.html">caar</a></code>
</b><br><br>
<b><a href="CDADAR.html">CDADAR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CADAR.html">cadar</a></code>
</b><br><br>
<b><a href="CDADDR.html">CDADDR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CADDR.html">caddr</a></code>
</b><br><br>
<b><a href="CDADR.html">CDADR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CADR.html">cadr</a></code>
</b><br><br>
<b><a href="CDAR.html">CDAR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CAR.html">car</a></code>
</b><br><br>
<b><a href="CDDAAR.html">CDDAAR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CDAAR.html">cdaar</a></code>
</b><br><br>
<b><a href="CDDADR.html">CDDADR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CDADR.html">cdadr</a></code>
</b><br><br>
<b><a href="CDDAR.html">CDDAR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CDAR.html">cdar</a></code>
</b><br><br>
<b><a href="CDDDAR.html">CDDDAR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CDDAR.html">cddar</a></code>
</b><br><br>
<b><a href="CDDDDR.html">CDDDDR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CDDDR.html">cdddr</a></code>
</b><br><br>
<b><a href="CDDDR.html">CDDDR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CDDR.html">cddr</a></code>
</b><br><br>
<b><a href="CDDR.html">CDDR</a> -- <code><a href="CDR.html">cdr</a></code> of the <code><a href="CDR.html">cdr</a></code>
</b><br><br>
<b><a href="CDR.html">CDR</a> -- returns the second element of a <code><a href="CONS.html">cons</a></code> pair, else <code>nil</code>
</b><br><br>
<b><a href="CEILING.html">CEILING</a> -- division returning an integer by truncating toward positive infinity
</b><br><br>
<b><a href="CERTIFICATE.html">CERTIFICATE</a> -- how a book is known to be admissible and where its <code><a href="DEFPKG.html">defpkg</a></code>s reside
</b><br><br>
<b><a href="CERTIFY-BOOK.html">CERTIFY-BOOK</a> -- how to produce a <a href="CERTIFICATE.html">certificate</a> for a book
</b><br><br>
<b><a href="CERTIFY-BOOK_bang_.html">CERTIFY-BOOK!</a> -- a variant of <code><a href="CERTIFY-BOOK.html">certify-book</a></code>
</b><br><br>
<b><a href="CHAR.html">CHAR</a> -- the <a href="NTH.html">nth</a> element (zero-based) of a string
</b><br><br>
<b><a href="CHAR-CODE.html">CHAR-CODE</a> -- the numeric code for a given character
</b><br><br>
<b><a href="CHAR-DOWNCASE.html">CHAR-DOWNCASE</a> -- turn upper-case <a href="CHARACTERS.html">characters</a> into lower-case <a href="CHARACTERS.html">characters</a>
</b><br><br>
<b><a href="CHAR-EQUAL.html">CHAR-EQUAL</a> -- character equality without regard to case
</b><br><br>
<b><a href="CHAR-UPCASE.html">CHAR-UPCASE</a> -- turn lower-case <a href="CHARACTERS.html">characters</a> into upper-case <a href="CHARACTERS.html">characters</a>
</b><br><br>
<b><a href="CHAR_lt_.html">CHAR<</a> -- less-than test for <a href="CHARACTERS.html">characters</a>
</b><br><br>
<b><a href="CHAR_lt_=.html">CHAR<=</a> -- less-than-or-equal test for <a href="CHARACTERS.html">characters</a>
</b><br><br>
<b><a href="CHAR_gt_.html">CHAR></a> -- greater-than test for <a href="CHARACTERS.html">characters</a>
</b><br><br>
<b><a href="CHAR_gt_=.html">CHAR>=</a> -- greater-than-or-equal test for <a href="CHARACTERS.html">characters</a>
</b><br><br>
<b><a href="CHARACTER-LISTP.html">CHARACTER-LISTP</a> -- recognizer for a true list of characters
</b><br><br>
<b><a href="CHARACTERP.html">CHARACTERP</a> -- recognizer for <a href="CHARACTERS.html">characters</a>
</b><br><br>
<b><a href="CHARACTERS.html">CHARACTERS</a> -- characters in ACL2
</b><br><br>
<b><a href="CHECK-SUM.html">CHECK-SUM</a> -- assigning ``often unique'' integers to files and objects
</b><br><br>
<b><a href="CHECKPOINT-FORCED-GOALS.html">CHECKPOINT-FORCED-GOALS</a> -- Cause forcing goals to be checkpointed in proof trees
</b><br><br>
<b><a href="CLAUSE-IDENTIFIER.html">CLAUSE-IDENTIFIER</a> -- the internal form of a <a href="GOAL-SPEC.html">goal-spec</a>
</b><br><br>
<b><a href="CLOSE-INPUT-CHANNEL.html">CLOSE-INPUT-CHANNEL</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="CLOSE-OUTPUT-CHANNEL.html">CLOSE-OUTPUT-CHANNEL</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="CLOSE-TRACE-FILE.html">CLOSE-TRACE-FILE</a> -- stop redirecting trace output to a file
</b><br><br>
<b><a href="CODE-CHAR.html">CODE-CHAR</a> -- the character corresponding to a given numeric code
</b><br><br>
<b><a href="COERCE.html">COERCE</a> -- coerce a character list to a string and a string to a list
</b><br><br>
<b><a href="COMMAND.html">COMMAND</a> -- forms you type at the top-level, but...
</b><br><br>
<b><a href="COMMAND-DESCRIPTOR.html">COMMAND-DESCRIPTOR</a> -- an object describing a particular <a href="COMMAND.html">command</a> typed by the user
</b><br><br>
<b><a href="COMP.html">COMP</a> -- compile some ACL2 functions
</b><br><br>
<b><a href="COMP-GCL.html">COMP-GCL</a> -- compile some ACL2 functions leaving .c and .h files
</b><br><br>
<b><a href="COMPILATION.html">COMPILATION</a> -- compiling ACL2 functions
</b><br><br>
<b><a href="COMPLEX.html">COMPLEX</a> -- create an ACL2 number
</b><br><br>
<b><a href="COMPLEX-RATIONALP.html">COMPLEX-RATIONALP</a> -- recognizes complex rational numbers
</b><br><br>
<b><a href="COMPLEX_slash_COMPLEX-RATIONALP.html">COMPLEX/COMPLEX-RATIONALP</a> -- recognizer for complex numbers
</b><br><br>
<b><a href="COMPOUND-RECOGNIZER.html">COMPOUND-RECOGNIZER</a> -- make a rule used by the typing mechanism
</b><br><br>
<b><a href="COMPRESS1.html">COMPRESS1</a> -- remove irrelevant pairs from a 1-dimensional array
</b><br><br>
<b><a href="COMPRESS2.html">COMPRESS2</a> -- remove irrelevant pairs from a 2-dimensional array
</b><br><br>
<b><a href="COMPUTED-HINTS.html">COMPUTED-HINTS</a> -- computing advice to the theorem proving process
</b><br><br>
<b><a href="CONCATENATE.html">CONCATENATE</a> -- concatenate lists or strings together
</b><br><br>
<b><a href="COND.html">COND</a> -- conditional based on if-then-else
</b><br><br>
<b><a href="CONGRUENCE.html">CONGRUENCE</a> -- the relations to maintain while simplifying arguments
</b><br><br>
<b><a href="CONJUGATE.html">CONJUGATE</a> -- complex number conjugate
</b><br><br>
<b><a href="CONS.html">CONS</a> -- pair and list constructor
</b><br><br>
<b><a href="CONSERVATIVITY-OF-DEFCHOOSE.html">CONSERVATIVITY-OF-DEFCHOOSE</a> -- proof of conservativity of <code><a href="DEFCHOOSE.html">defchoose</a></code>
</b><br><br>
<b><a href="CONSP.html">CONSP</a> -- recognizer for <a href="CONS.html">cons</a> pairs
</b><br><br>
<b><a href="CONSTRAINT.html">CONSTRAINT</a> -- restrictions on certain functions introduced in <code><a href="ENCAPSULATE.html">encapsulate</a></code> <a href="EVENTS.html">events</a>
</b><br><br>
<b><a href="COPYRIGHT.html">COPYRIGHT</a> -- ACL2 copyright, license, sponsorship
</b><br><br>
<b><a href="COROLLARY.html">COROLLARY</a> -- the corollary formula of a <a href="RUNE.html">rune</a>
</b><br><br>
<b><a href="CURRENT-PACKAGE.html">CURRENT-PACKAGE</a> -- the package used for reading and printing
</b><br><br>
<b><a href="CURRENT-THEORY.html">CURRENT-THEORY</a> -- currently <a href="ENABLE.html">enable</a>d rules as of logical name
</b><br><br>
<b><a href="CW.html">CW</a> -- print to the comment window
</b><br><br>
<b><a href="CW-GSTACK.html">CW-GSTACK</a> -- debug a rewriting loop or stack overflow
</b><br><br>
<b><a href="Common_Lisp.html">Common Lisp</a> -- Common Lisp
</b><br><br>
<b><a href="Common_Lisp_as_a_Modeling_Language.html">Common Lisp as a Modeling Language</a> -- Common Lisp as a Modeling Language
</b><br><br>
<b><a href="Conversion.html">Conversion</a> -- Conversion to Uppercase
</b><br><br>
<b><a href="Corroborating_Models.html">Corroborating Models</a> -- Corroborating Models
</b><br><br>
<BR><BR><H1><A NAME="D">D</A></H1>
<b><a href="DECLARE.html">DECLARE</a> -- declarations
</b><br><br>
<b><a href="DECLARE-STOBJS.html">DECLARE-STOBJS</a> -- declaring a formal parameter name to be a single-threaded object
</b><br><br>
<b><a href="DEFABBREV.html">DEFABBREV</a> -- a convenient form of macro definition for simple expansions
</b><br><br>
<b><a href="DEFAULT.html">DEFAULT</a> -- return the <code>:default</code> from the <a href="HEADER.html">header</a> of a 1- or 2-dimensional array
</b><br><br>
<b><a href="DEFAULT-BACKCHAIN-LIMIT.html">DEFAULT-BACKCHAIN-LIMIT</a> -- specifying the backchain limit for a rule
</b><br><br>
<b><a href="DEFAULT-DEFUN-MODE.html">DEFAULT-DEFUN-MODE</a> -- the default <a href="DEFUN-MODE.html">defun-mode</a> of <code><a href="DEFUN.html">defun</a></code>'d functions
</b><br><br>
<b><a href="DEFAULT-HINTS.html">DEFAULT-HINTS</a> -- a list of hints added to every proof attempt
</b><br><br>
<b><a href="DEFAULT-HINTS-TABLE.html">DEFAULT-HINTS-TABLE</a> -- a <a href="TABLE.html">table</a> used to provide <a href="HINTS.html">hints</a> for proofs
</b><br><br>
<b><a href="DEFAULT-PRINT-PROMPT.html">DEFAULT-PRINT-PROMPT</a> -- the default <a href="PROMPT.html">prompt</a> printed by <code><a href="LD.html">ld</a></code>
</b><br><br>
<b><a href="DEFAXIOM.html">DEFAXIOM</a> -- add an axiom
</b><br><br>
<b><a href="DEFCHOOSE.html">DEFCHOOSE</a> -- define a Skolem (witnessing) function
</b><br><br>
<b><a href="DEFCONG.html">DEFCONG</a> -- prove that one <a href="EQUIVALENCE.html">equivalence</a> relation preserves another in a given
<br><code> </code> argument position of a given function
</b><br><br>
<b><a href="DEFCONST.html">DEFCONST</a> -- define a constant
</b><br><br>
<b><a href="DEFDOC.html">DEFDOC</a> -- add a <a href="DOCUMENTATION.html">documentation</a> topic
</b><br><br>
<b><a href="DEFEQUIV.html">DEFEQUIV</a> -- prove that a function is an <a href="EQUIVALENCE.html">equivalence</a> relation
</b><br><br>
<b><a href="DEFEVALUATOR.html">DEFEVALUATOR</a> -- introduce an evaluator function
</b><br><br>
<b><a href="DEFEXEC.html">DEFEXEC</a> -- attach a terminating executable function to a definition
</b><br><br>
<b><a href="DEFINE-PC-HELP.html">DEFINE-PC-HELP</a> -- define a macro command whose purpose is to print something
</b><br><br>
<b><a href="DEFINE-PC-MACRO.html">DEFINE-PC-MACRO</a> -- define a proof-checker macro command
</b><br><br>
<b><a href="DEFINE-PC-META.html">DEFINE-PC-META</a> -- define a proof-checker meta command
</b><br><br>
<b><a href="DEFINITION.html">DEFINITION</a> -- make a rule that acts like a function definition
</b><br><br>
<b><a href="DEFLABEL.html">DEFLABEL</a> -- build a landmark and/or add a <a href="DOCUMENTATION.html">documentation</a> topic
</b><br><br>
<b><a href="DEFMACRO.html">DEFMACRO</a> -- define a macro
</b><br><br>
<b><a href="DEFPKG.html">DEFPKG</a> -- define a new symbol package
</b><br><br>
<b><a href="DEFREFINEMENT.html">DEFREFINEMENT</a> -- prove that <code>equiv1</code> refines <code>equiv2</code>
</b><br><br>
<b><a href="DEFSTOBJ.html">DEFSTOBJ</a> -- define a new single-threaded object
</b><br><br>
<b><a href="DEFSTUB.html">DEFSTUB</a> -- stub-out a function symbol
</b><br><br>
<b><a href="DEFTHEORY.html">DEFTHEORY</a> -- define a theory (to <a href="ENABLE.html">enable</a> or <a href="DISABLE.html">disable</a> a set of rules)
</b><br><br>
<b><a href="DEFTHM.html">DEFTHM</a> -- prove and name a theorem
</b><br><br>
<b><a href="DEFTHMD.html">DEFTHMD</a> -- prove and name a theorem and then disable it
</b><br><br>
<b><a href="DEFTTAG.html">DEFTTAG</a> -- introduce a trust tag (ttag)
</b><br><br>
<b><a href="DEFUN.html">DEFUN</a> -- define a function symbol
</b><br><br>
<b><a href="DEFUN-MODE.html">DEFUN-MODE</a> -- determines whether a function definition is a logical act
</b><br><br>
<b><a href="DEFUN-MODE-CAVEAT.html">DEFUN-MODE-CAVEAT</a> -- functions with <a href="DEFUN-MODE.html">defun-mode</a> of <code>:</code><code><a href="PROGRAM.html">program</a></code> considered unsound
</b><br><br>
<b><a href="DEFUN-SK.html">DEFUN-SK</a> -- define a function whose body has an outermost quantifier
</b><br><br>
<b><a href="DEFUN-SK-EXAMPLE.html">DEFUN-SK-EXAMPLE</a> -- a simple example using <code><a href="DEFUN-SK.html">defun-sk</a></code>
</b><br><br>
<b><a href="DEFUND.html">DEFUND</a> -- define a function symbol and then disable it
</b><br><br>
<b><a href="DEFUNS.html">DEFUNS</a> -- an alternative to <code><a href="MUTUAL-RECURSION.html">mutual-recursion</a></code>
</b><br><br>
<b><a href="DELETE-INCLUDE-BOOK-DIR.html">DELETE-INCLUDE-BOOK-DIR</a> -- remove association of keyword for <code><a href="INCLUDE-BOOK.html">include-book</a></code>'s <code>:dir</code> argument
</b><br><br>
<b><a href="DENOMINATOR.html">DENOMINATOR</a> -- divisor of a ratio in lowest terms
</b><br><br>
<b><a href="DIGIT-CHAR-P.html">DIGIT-CHAR-P</a> -- the number, if any, corresponding to a given character
</b><br><br>
<b><a href="DIGIT-TO-CHAR.html">DIGIT-TO-CHAR</a> -- map a digit to a character
</b><br><br>
<b><a href="DIMENSIONS.html">DIMENSIONS</a> -- return the <code>:dimensions</code> from the <a href="HEADER.html">header</a> of a 1- or 2-dimensional array
</b><br><br>
<b><a href="DISABLE.html">DISABLE</a> -- deletes names from current theory
</b><br><br>
<b><a href="DISABLE-FORCING.html">DISABLE-FORCING</a> -- to disallow <code><a href="FORCE.html">force</a></code>d <code><a href="CASE-SPLIT.html">case-split</a></code>s
</b><br><br>
<b><a href="DISABLE-IMMEDIATE-FORCE-MODEP.html">DISABLE-IMMEDIATE-FORCE-MODEP</a> -- <a href="FORCE.html">force</a>d hypotheses are not attacked immediately
</b><br><br>
<b><a href="DISABLEDP.html">DISABLEDP</a> -- determine whether a given name or rune is disabled
</b><br><br>
<b><a href="DIVE-INTO-MACROS-TABLE.html">DIVE-INTO-MACROS-TABLE</a> -- right-associated function information for the <a href="PROOF-CHECKER.html">proof-checker</a>
</b><br><br>
<b><a href="DO-NOT.html">DO-NOT</a> -- hints keyword <code>:DO-NOT</code>
</b><br><br>
<b><a href="DO-NOT-INDUCT.html">DO-NOT-INDUCT</a> -- hints keyword <code>:DO-NOT-INDUCT</code>
</b><br><br>
<b><a href="DOC.html">DOC</a> -- brief <a href="DOCUMENTATION.html">documentation</a> (type <code>:doc name</code>)
</b><br><br>
<b><a href="DOC_bang_.html">DOC!</a> -- all the <a href="DOCUMENTATION.html">documentation</a> for a name (type <code>:doc! name</code>)
</b><br><br>
<b><a href="DOC-STRING.html">DOC-STRING</a> -- formatted <a href="DOCUMENTATION.html">documentation</a> strings
</b><br><br>
<b><a href="DOCS.html">DOCS</a> -- available <a href="DOCUMENTATION.html">documentation</a> topics (by section)
</b><br><br>
<b><a href="DOCUMENTATION.html">DOCUMENTATION</a> -- functions that display documentation at the terminal
</b><br><br>
<b><a href="DOUBLE-REWRITE.html">DOUBLE-REWRITE</a> -- cause a term to be rewritten twice
</b><br><br>
<BR><BR><H1><A NAME="E">E</A></H1>
<b><a href="E_slash_D.html">E/D</a> -- enable/disable rules
</b><br><br>
<b><a href="E0-ORD-_lt_.html">E0-ORD-<</a> -- the old ordering function for ACL2 ordinals
</b><br><br>
<b><a href="E0-ORDINALP.html">E0-ORDINALP</a> -- the old recognizer for ACL2 ordinals
</b><br><br>
<b><a href="EIGHTH.html">EIGHTH</a> -- eighth member of the list
</b><br><br>
<b><a href="ELIM.html">ELIM</a> -- make a destructor elimination rule
</b><br><br>
<b><a href="EMBEDDED-EVENT-FORM.html">EMBEDDED-EVENT-FORM</a> -- forms that may be embedded in other <a href="EVENTS.html">events</a>
</b><br><br>
<b><a href="ENABLE.html">ENABLE</a> -- adds names to current theory
</b><br><br>
<b><a href="ENABLE-FORCING.html">ENABLE-FORCING</a> -- to allow <code><a href="FORCE.html">force</a></code>d <code><a href="CASE.html">split</a></code>s
</b><br><br>
<b><a href="ENABLE-IMMEDIATE-FORCE-MODEP.html">ENABLE-IMMEDIATE-FORCE-MODEP</a> -- <a href="FORCE.html">force</a>d hypotheses are attacked immediately
</b><br><br>
<b><a href="ENCAPSULATE.html">ENCAPSULATE</a> -- constrain some functions and/or hide some <a href="EVENTS.html">events</a>
</b><br><br>
<b><a href="ENDP.html">ENDP</a> -- recognizer for empty lists
</b><br><br>
<b><a href="ENTER-BOOT-STRAP-MODE.html">ENTER-BOOT-STRAP-MODE</a> -- The first millisecond of the Big Bang
</b><br><br>
<b><a href="EQ.html">EQ</a> -- equality of symbols
</b><br><br>
<b><a href="EQL.html">EQL</a> -- test equality (of two numbers, symbols, or <a href="CHARACTERS.html">characters</a>)
</b><br><br>
<b><a href="EQLABLE-ALISTP.html">EQLABLE-ALISTP</a> -- recognizer for a true list of pairs whose <code><a href="CAR.html">car</a></code>s are suitable for <code><a href="EQL.html">eql</a></code>
</b><br><br>
<b><a href="EQLABLE-LISTP.html">EQLABLE-LISTP</a> -- recognizer for a true list of objects each suitable for <code><a href="EQL.html">eql</a></code>
</b><br><br>
<b><a href="EQLABLEP.html">EQLABLEP</a> -- the <a href="GUARD.html">guard</a> for the function <code><a href="EQL.html">eql</a></code>
</b><br><br>
<b><a href="EQUAL.html">EQUAL</a> -- true equality
</b><br><br>
<b><a href="EQUIVALENCE.html">EQUIVALENCE</a> -- mark a relation as an equivalence relation
</b><br><br>
<b><a href="ER.html">ER</a> -- print an error message and ``cause an error''
</b><br><br>
<b><a href="ER-PROGN.html">ER-PROGN</a> -- perform a sequence of state-changing ``error triples''
</b><br><br>
<b><a href="ERROR1.html">ERROR1</a> -- print an error message and cause a ``soft error''
</b><br><br>
<b><a href="ESCAPE-TO-COMMON-LISP.html">ESCAPE-TO-COMMON-LISP</a> -- escaping to Common Lisp
</b><br><br>
<b><a href="EVENP.html">EVENP</a> -- test whether an integer is even
</b><br><br>
<b><a href="EVENTS.html">EVENTS</a> -- functions that extend the logic
</b><br><br>
<b><a href="EVISCERATE-HIDE-TERMS.html">EVISCERATE-HIDE-TERMS</a> -- to print <code>(hide ...)</code> as <code><hidden></code>
</b><br><br>
<b><a href="EXECUTABLE-COUNTERPART.html">EXECUTABLE-COUNTERPART</a> -- a rule for computing the value of a function
</b><br><br>
<b><a href="EXECUTABLE-COUNTERPART-THEORY.html">EXECUTABLE-COUNTERPART-THEORY</a> -- executable counterpart rules as of logical name
</b><br><br>
<b><a href="EXISTS.html">EXISTS</a> -- existential quantifier
</b><br><br>
<b><a href="EXIT.html">EXIT</a> -- quit entirely out of Lisp
</b><br><br>
<b><a href="EXIT-BOOT-STRAP-MODE.html">EXIT-BOOT-STRAP-MODE</a> -- the end of pre-history
</b><br><br>
<b><a href="EXPAND.html">EXPAND</a> -- hints keyword <code>:EXPAND</code>
</b><br><br>
<b><a href="EXPLODE-NONNEGATIVE-INTEGER.html">EXPLODE-NONNEGATIVE-INTEGER</a> -- the list of <a href="CHARACTERS.html">characters</a> in the radix-r form of a number
</b><br><br>
<b><a href="EXPT.html">EXPT</a> -- exponential function
</b><br><br>
<b><a href="EXTENDED-METAFUNCTIONS.html">EXTENDED-METAFUNCTIONS</a> -- state and context sensitive metafunctions
</b><br><br>
<b><a href="Evaluating_App_on_Sample_Input.html">Evaluating App on Sample Input</a> -- Evaluating App on Sample Input
</b><br><br>
<BR><BR><H1><A NAME="F">F</A></H1>
<b><a href="FAILED-FORCING.html">FAILED-FORCING</a> -- how to deal with a proof <a href="FAILURE.html">failure</a> in a forcing round
</b><br><br>
<b><a href="FAILURE.html">FAILURE</a> -- how to deal with a proof failure
</b><br><br>
<b><a href="FIFTH.html">FIFTH</a> -- fifth member of the list
</b><br><br>
<b><a href="FILE-READING-EXAMPLE.html">FILE-READING-EXAMPLE</a> -- example of reading files in ACL2
</b><br><br>
<b><a href="FIND-RULES-OF-RUNE.html">FIND-RULES-OF-RUNE</a> -- find the rules named rune
</b><br><br>
<b><a href="FIRST.html">FIRST</a> -- first member of the list
</b><br><br>
<b><a href="FIX.html">FIX</a> -- coerce to a number
</b><br><br>
<b><a href="FIX-TRUE-LIST.html">FIX-TRUE-LIST</a> -- coerce to a true list
</b><br><br>
<b><a href="FLOOR.html">FLOOR</a> -- division returning an integer by truncating toward negative infinity
</b><br><br>
<b><a href="FLUSH-COMPRESS.html">FLUSH-COMPRESS</a> -- flush the under-the-hood array for the given name
</b><br><br>
<b><a href="FMS.html">FMS</a> -- <code>:(str alist co-channel state evisc) => state</code>
</b><br><br>
<b><a href="FMS_bang_.html">FMS!</a> -- <code>:(str alist co-channel state evisc) => state</code>
</b><br><br>
<b><a href="FMT.html">FMT</a> -- formatted printing
</b><br><br>
<b><a href="FMT_bang_.html">FMT!</a> -- <code>:(str alist co-channel state evisc) => state</code>
</b><br><br>
<b><a href="FMT-TO-COMMENT-WINDOW.html">FMT-TO-COMMENT-WINDOW</a> -- print to the comment window
</b><br><br>
<b><a href="FMT1.html">FMT1</a> -- <code>:(str alist col co-channel state evisc) => (mv col state)</code>
</b><br><br>
<b><a href="FMT1_bang_.html">FMT1!</a> -- <code>:(str alist col channel state evisc) => (mv col state)</code>
</b><br><br>
<b><a href="FORALL.html">FORALL</a> -- universal quantifier
</b><br><br>
<b><a href="FORCE.html">FORCE</a> -- identity function used to force a hypothesis
</b><br><br>
<b><a href="FORCING-ROUND.html">FORCING-ROUND</a> -- a section of a proof dealing with <a href="FORCE.html">force</a>d assumptions
</b><br><br>
<b><a href="FORWARD-CHAINING.html">FORWARD-CHAINING</a> -- make a rule to forward chain when a certain trigger arises
</b><br><br>
<b><a href="FOURTH.html">FOURTH</a> -- fourth member of the list
</b><br><br>
<b><a href="FREE-VARIABLES.html">FREE-VARIABLES</a> -- free variables in rules
</b><br><br>
<b><a href="FREE-VARIABLES-EXAMPLES.html">FREE-VARIABLES-EXAMPLES</a> -- examples pertaining to free variables in rules
</b><br><br>
<b><a href="FREE-VARIABLES-EXAMPLES-FORWARD-CHAINING.html">FREE-VARIABLES-EXAMPLES-FORWARD-CHAINING</a> -- examples pertaining to free variables in <a href="FORWARD-CHAINING.html">forward-chaining</a> rules
</b><br><br>
<b><a href="FREE-VARIABLES-EXAMPLES-REWRITE.html">FREE-VARIABLES-EXAMPLES-REWRITE</a> -- examples pertaining to free variables in <a href="REWRITE.html">rewrite</a> rules
</b><br><br>
<b><a href="FULL-BOOK-NAME.html">FULL-BOOK-NAME</a> -- book naming conventions assumed by ACL2
</b><br><br>
<b><a href="FUNCTION-THEORY.html">FUNCTION-THEORY</a> -- function symbol rules as of logical name
</b><br><br>
<b><a href="FUNCTIONAL-INSTANTIATION-EXAMPLE.html">FUNCTIONAL-INSTANTIATION-EXAMPLE</a> -- a small proof demonstrating functional instantiation
</b><br><br>
<b><a href="Flawed_Induction_Candidates_in_App_Example.html">Flawed Induction Candidates in App Example</a> -- Flawed Induction Candidates in App Example
</b><br><br>
<b><a href="Free_Variables_in_Top-Level_Input.html">Free Variables in Top-Level Input</a> -- Free Variables in Top-Level Input
</b><br><br>
<b><a href="Functions_for_Manipulating_these_Objects.html">Functions for Manipulating these Objects</a> -- Functions for Manipulating these Objects
</b><br><br>
<BR><BR><H1><A NAME="G">G</A></H1>
<b><a href="GC$.html">GC$</a> -- invoke the garbage collector
</b><br><br>
<b><a href="GCL.html">GCL</a> -- tips on building and using ACL2 based on Gnu Common Lisp
</b><br><br>
<b><a href="GENERALIZE.html">GENERALIZE</a> -- make a rule to restrict generalizations
</b><br><br>
<b><a href="GENERALIZED-BOOLEANS.html">GENERALIZED-BOOLEANS</a> -- potential soundness issues related to ACL2 predicates
</b><br><br>
<b><a href="GETENV$.html">GETENV$</a> -- read an environment variable
</b><br><br>
<b><a href="GOAL-SPEC.html">GOAL-SPEC</a> -- to indicate where a hint is to be used
</b><br><br>
<b><a href="GOOD-BYE.html">GOOD-BYE</a> -- quit entirely out of Lisp
</b><br><br>
<b><a href="GROUND-ZERO.html">GROUND-ZERO</a> -- <a href="ENABLE.html">enable</a>d rules in the <a href="STARTUP.html">startup</a> theory
</b><br><br>
<b><a href="GUARD.html">GUARD</a> -- restricting the domain of a function
</b><br><br>
<b><a href="GUARD-EVALUATION-EXAMPLES-LOG.html">GUARD-EVALUATION-EXAMPLES-LOG</a> -- log showing combinations of <a href="DEFUN-MODE.html">defun-mode</a>s and <a href="GUARD.html">guard</a>-checking
</b><br><br>
<b><a href="GUARD-EVALUATION-EXAMPLES-SCRIPT.html">GUARD-EVALUATION-EXAMPLES-SCRIPT</a> -- a script to show combinations of <a href="DEFUN-MODE.html">defun-mode</a>s and <a href="GUARD.html">guard</a>-checking
</b><br><br>
<b><a href="GUARD-EVALUATION-TABLE.html">GUARD-EVALUATION-TABLE</a> -- a table that shows combinations of <a href="DEFUN-MODE.html">defun-mode</a>s and <a href="GUARD.html">guard</a>-checking
</b><br><br>
<b><a href="GUARD-EXAMPLE.html">GUARD-EXAMPLE</a> -- a brief transcript illustrating <a href="GUARD.html">guard</a>s in ACL2
</b><br><br>
<b><a href="GUARD-HINTS.html">GUARD-HINTS</a> -- xargs keyword <code>:GUARD-HINTS</code>
</b><br><br>
<b><a href="GUARD-INTRODUCTION.html">GUARD-INTRODUCTION</a> -- introduction to <a href="GUARD.html">guard</a>s in ACL2
</b><br><br>
<b><a href="GUARD-MISCELLANY.html">GUARD-MISCELLANY</a> -- miscellaneous remarks about guards
</b><br><br>
<b><a href="GUARD-QUICK-REFERENCE.html">GUARD-QUICK-REFERENCE</a> -- brief summary of guard checking and guard verification
</b><br><br>
<b><a href="GUARDS-AND-EVALUATION.html">GUARDS-AND-EVALUATION</a> -- the relationship between guards and evaluation
</b><br><br>
<b><a href="GUARDS-FOR-SPECIFICATION.html">GUARDS-FOR-SPECIFICATION</a> -- guards as a specification device
</b><br><br>
<b><a href="Guards.html">Guards</a> -- Guards
</b><br><br>
<b><a href="Guessing_the_Type_of_a_Newly_Admitted_Function.html">Guessing the Type of a Newly Admitted Function</a> -- Guessing the Type of a Newly Admitted Function
</b><br><br>
<b><a href="Guiding_the_ACL2_Theorem_Prover.html">Guiding the ACL2 Theorem Prover</a> -- Guiding the ACL2 Theorem Prover
</b><br><br>
<BR><BR><H1><A NAME="H">H</A></H1>
<b><a href="HANDS-OFF.html">HANDS-OFF</a> -- hints keyword <code>:HANDS-OFF</code>
</b><br><br>
<b><a href="HARD-ERROR.html">HARD-ERROR</a> -- print an error message and stop execution
</b><br><br>
<b><a href="HEADER.html">HEADER</a> -- return the header of a 1- or 2-dimensional array
</b><br><br>
<b><a href="HELP.html">HELP</a> -- brief survey of ACL2 features
</b><br><br>
<b><a href="HIDDEN-DEATH-PACKAGE.html">HIDDEN-DEATH-PACKAGE</a> -- handling <code><a href="DEFPKG.html">defpkg</a></code> <a href="EVENTS.html">events</a> that are <code><a href="LOCAL.html">local</a></code>
</b><br><br>
<b><a href="HIDDEN-DEFPKG.html">HIDDEN-DEFPKG</a> -- handling defpkg events that are local
</b><br><br>
<b><a href="HIDE.html">HIDE</a> -- hide a term from the rewriter
</b><br><br>
<b><a href="HINTS.html">HINTS</a> -- advice to the theorem proving process
</b><br><br>
<b><a href="HISTORY.html">HISTORY</a> -- functions that display or change history
</b><br><br>
<b><a href="Hey_Wait_bang___Is_ACL2_Typed_or_Untyped_lparen_Q_rparen_.html">Hey Wait! Is ACL2 Typed or Untyped(Q)</a> -- Hey Wait! Is ACL2 Typed or Untyped?
</b><br><br>
<b><a href="How_Long_Does_It_Take_to_Become_an_Effective_User_lparen_Q_rparen_.html">How Long Does It Take to Become an Effective User(Q)</a> -- How Long Does It Take to Become an Effective User?
</b><br><br>
<b><a href="How_To_Find_Out_about_ACL2_Functions.html">How To Find Out about ACL2 Functions</a> -- How To Find Out about ACL2 Functions
</b><br><br>
<b><a href="How_To_Find_Out_about_ACL2_Functions__lparen_cont_rparen_.html">How To Find Out about ACL2 Functions (cont)</a> -- How To Find Out about ACL2 Functions (cont)
</b><br><br>
<BR><BR><H1><A NAME="I">I</A></H1>
<b><a href="I-AM-HERE.html">I-AM-HERE</a> -- a convenient marker for use with <code><a href="REBUILD.html">rebuild</a></code>
</b><br><br>
<b><a href="I-CLOSE.html">I-CLOSE</a> -- ACL2(r) test for whether two numbers are infinitesimally close
</b><br><br>
<b><a href="I-LARGE.html">I-LARGE</a> -- ACL2(r) recognizer for infinitely large numbers
</b><br><br>
<b><a href="I-LIMITED.html">I-LIMITED</a> -- ACL2(r) recognizer for limited numbers
</b><br><br>
<b><a href="I-SMALL.html">I-SMALL</a> -- ACL2(r) recognizer for infinitesimal numbers
</b><br><br>
<b><a href="IDENTITY.html">IDENTITY</a> -- the identity function
</b><br><br>
<b><a href="IF.html">IF</a> -- if-then-else function
</b><br><br>
<b><a href="IF_star_.html">IF*</a> -- for conditional rewriting with BDDs
</b><br><br>
<b><a href="IFF.html">IFF</a> -- logical ``if and only if''
</b><br><br>
<b><a href="IFIX.html">IFIX</a> -- coerce to an integer
</b><br><br>
<b><a href="ILLEGAL.html">ILLEGAL</a> -- print an error message and stop execution
</b><br><br>
<b><a href="IMAGPART.html">IMAGPART</a> -- imaginary part of a complex number
</b><br><br>
<b><a href="IMMEDIATE-FORCE-MODEP.html">IMMEDIATE-FORCE-MODEP</a> -- when executable counterpart is <a href="ENABLE.html">enable</a>d,
<br><code> </code> <a href="FORCE.html">force</a>d hypotheses are attacked immediately
</b><br><br>
<b><a href="IMPLIES.html">IMPLIES</a> -- logical implication
</b><br><br>
<b><a href="IMPROPER-CONSP.html">IMPROPER-CONSP</a> -- recognizer for improper (non-null-terminated) non-empty lists
</b><br><br>
<b><a href="IN-ARITHMETIC-THEORY.html">IN-ARITHMETIC-THEORY</a> -- designate ``current'' theory for some rewriting done in linear arithmetic
</b><br><br>
<b><a href="IN-PACKAGE.html">IN-PACKAGE</a> -- select current package
</b><br><br>
<b><a href="IN-THEORY.html">IN-THEORY</a> -- designate ``current'' theory (enabling its rules)
</b><br><br>
<b><a href="INCLUDE-BOOK.html">INCLUDE-BOOK</a> -- load the <a href="EVENTS.html">events</a> in a file
</b><br><br>
<b><a href="INCOMPATIBLE.html">INCOMPATIBLE</a> -- declaring that two rules should not both be <a href="ENABLE.html">enable</a>d
</b><br><br>
<b><a href="INDUCT.html">INDUCT</a> -- hints keyword <code>:INDUCT</code>
</b><br><br>
<b><a href="INDUCTION.html">INDUCTION</a> -- make a rule that suggests a certain induction
</b><br><br>
<b><a href="INSTRUCTIONS.html">INSTRUCTIONS</a> -- instructions to the proof checker
</b><br><br>
<b><a href="INT=.html">INT=</a> -- test equality of two integers
</b><br><br>
<b><a href="INTEGER-LENGTH.html">INTEGER-LENGTH</a> -- number of bits in two's complement integer representation
</b><br><br>
<b><a href="INTEGER-LISTP.html">INTEGER-LISTP</a> -- recognizer for a true list of integers
</b><br><br>
<b><a href="INTEGERP.html">INTEGERP</a> -- recognizer for whole numbers
</b><br><br>
<b><a href="INTERN.html">INTERN</a> -- create a new symbol in a given package
</b><br><br>
<b><a href="INTERN$.html">INTERN$</a> -- create a new symbol in a given package
</b><br><br>
<b><a href="INTERN-IN-PACKAGE-OF-SYMBOL.html">INTERN-IN-PACKAGE-OF-SYMBOL</a> -- create a symbol with a given name
</b><br><br>
<b><a href="INTERSECTION-THEORIES.html">INTERSECTION-THEORIES</a> -- intersect two <a href="THEORIES.html">theories</a>
</b><br><br>
<b><a href="INTERSECTP-EQ.html">INTERSECTP-EQ</a> -- test whether two lists of symbols intersect
</b><br><br>
<b><a href="INTERSECTP-EQUAL.html">INTERSECTP-EQUAL</a> -- test whether two lists intersect
</b><br><br>
<b><a href="INTRODUCTION.html">INTRODUCTION</a> -- introduction to ACL2
</b><br><br>
<b><a href="INVISIBLE-FNS-TABLE.html">INVISIBLE-FNS-TABLE</a> -- functions that are invisible to the <a href="LOOP-STOPPER.html">loop-stopper</a> algorithm
</b><br><br>
<b><a href="IO.html">IO</a> -- input/output facilities in ACL2
</b><br><br>
<b><a href="IRRELEVANT-FORMALS.html">IRRELEVANT-FORMALS</a> -- formals that are used but only insignificantly
</b><br><br>
<BR><BR><H1>J</H1>
<BR><BR><H1><A NAME="K">K</A></H1>
<b><a href="KEEP.html">KEEP</a> -- how we know if <code><a href="INCLUDE-BOOK.html">include-book</a></code> read the correct files
</b><br><br>
<b><a href="KEYWORD-COMMANDS.html">KEYWORD-COMMANDS</a> -- how keyword commands are processed
</b><br><br>
<b><a href="KEYWORD-VALUE-LISTP.html">KEYWORD-VALUE-LISTP</a> -- recognizer for true lists whose even-position elements are keywords
</b><br><br>
<b><a href="KEYWORDP.html">KEYWORDP</a> -- recognizer for keywords
</b><br><br>
<BR><BR><H1><A NAME="L">L</A></H1>
<b><a href="LAMBDA.html">LAMBDA</a> -- See <a href="TERM.html">term</a>.
</b><br><br>
<b><a href="LAST.html">LAST</a> -- the last <code><a href="CONS.html">cons</a></code> (not element) of a list
</b><br><br>
<b><a href="LD.html">LD</a> -- the ACL2 read-eval-print loop, file loader, and <a href="COMMAND.html">command</a> processor
</b><br><br>
<b><a href="LD-ERROR-ACTION.html">LD-ERROR-ACTION</a> -- determines <code><a href="LD.html">ld</a></code>'s response to an error
</b><br><br>
<b><a href="LD-ERROR-TRIPLES.html">LD-ERROR-TRIPLES</a> -- determines whether a form caused an error during <code><a href="LD.html">ld</a></code>
</b><br><br>
<b><a href="LD-EVISC-TUPLE.html">LD-EVISC-TUPLE</a> -- determines whether <code><a href="LD.html">ld</a></code> suppresses details when printing
</b><br><br>
<b><a href="LD-KEYWORD-ALIASES.html">LD-KEYWORD-ALIASES</a> -- allows the abbreviation of some keyword commands
</b><br><br>
<b><a href="LD-POST-EVAL-PRINT.html">LD-POST-EVAL-PRINT</a> -- determines whether and how <code><a href="LD.html">ld</a></code> prints the result of evaluation
</b><br><br>
<b><a href="LD-PRE-EVAL-FILTER.html">LD-PRE-EVAL-FILTER</a> -- determines which forms <code><a href="LD.html">ld</a></code> evaluates
</b><br><br>
<b><a href="LD-PRE-EVAL-PRINT.html">LD-PRE-EVAL-PRINT</a> -- determines whether <code><a href="LD.html">ld</a></code> prints the forms to be <code>eval</code>'d
</b><br><br>
<b><a href="LD-PROMPT.html">LD-PROMPT</a> -- determines the <a href="PROMPT.html">prompt</a> printed by <code><a href="LD.html">ld</a></code>
</b><br><br>
<b><a href="LD-QUERY-CONTROL-ALIST.html">LD-QUERY-CONTROL-ALIST</a> -- how to default answers to queries
</b><br><br>
<b><a href="LD-REDEFINITION-ACTION.html">LD-REDEFINITION-ACTION</a> -- to allow redefinition without undoing
</b><br><br>
<b><a href="LD-SKIP-PROOFSP.html">LD-SKIP-PROOFSP</a> -- how carefully ACL2 processes your <a href="COMMAND.html">command</a>s
</b><br><br>
<b><a href="LD-VERBOSE.html">LD-VERBOSE</a> -- determines whether <code><a href="LD.html">ld</a></code> prints ``ACL2 Loading ...''
</b><br><br>
<b><a href="LEMMA-INSTANCE.html">LEMMA-INSTANCE</a> -- an object denoting an instance of a theorem
</b><br><br>
<b><a href="LEN.html">LEN</a> -- length of a list
</b><br><br>
<b><a href="LENGTH.html">LENGTH</a> -- length of a string or proper list
</b><br><br>
<b><a href="LET.html">LET</a> -- binding of lexically scoped (local) variables
</b><br><br>
<b><a href="LET_star_.html">LET*</a> -- binding of lexically scoped (local) variables
</b><br><br>
<b><a href="LEXORDER.html">LEXORDER</a> -- total order on ACL2 objects
</b><br><br>
<b><a href="LINEAR.html">LINEAR</a> -- make some arithmetic inequality rules
</b><br><br>
<b><a href="LINEAR-ARITHMETIC.html">LINEAR-ARITHMETIC</a> -- A description of the linear arithmetic decision procedure
</b><br><br>
<b><a href="LIST.html">LIST</a> -- build a list
</b><br><br>
<b><a href="LIST_star_.html">LIST*</a> -- build a list
</b><br><br>
<b><a href="LISTP.html">LISTP</a> -- recognizer for (not necessarily proper) lists
</b><br><br>
<b><a href="LOCAL.html">LOCAL</a> -- hiding an event in an encapsulation or book
</b><br><br>
<b><a href="LOCAL-INCOMPATIBILITY.html">LOCAL-INCOMPATIBILITY</a> -- when non-local <a href="EVENTS.html">events</a> won't replay in isolation
</b><br><br>
<b><a href="LOGAND.html">LOGAND</a> -- bitwise logical `and' of zero or more integers
</b><br><br>
<b><a href="LOGANDC1.html">LOGANDC1</a> -- bitwise logical `and' of two ints, complementing the first
</b><br><br>
<b><a href="LOGANDC2.html">LOGANDC2</a> -- bitwise logical `and' of two ints, complementing the second
</b><br><br>
<b><a href="LOGBITP.html">LOGBITP</a> -- the <code>i</code>th bit of an integer
</b><br><br>
<b><a href="LOGCOUNT.html">LOGCOUNT</a> -- number of ``on'' bits in a two's complement number
</b><br><br>
<b><a href="LOGEQV.html">LOGEQV</a> -- bitwise logical equivalence of zero or more integers
</b><br><br>
<b><a href="LOGIC.html">LOGIC</a> -- to set the default <a href="DEFUN-MODE.html">defun-mode</a> to <code>:logic</code>
</b><br><br>
<b><a href="LOGICAL-NAME.html">LOGICAL-NAME</a> -- a name created by a logical event
</b><br><br>
<b><a href="LOGIOR.html">LOGIOR</a> -- bitwise logical inclusive or of zero or more integers
</b><br><br>
<b><a href="LOGNAND.html">LOGNAND</a> -- bitwise logical `nand' of two integers
</b><br><br>
<b><a href="LOGNOR.html">LOGNOR</a> -- bitwise logical `nor' of two integers
</b><br><br>
<b><a href="LOGNOT.html">LOGNOT</a> -- bitwise not of a two's complement number
</b><br><br>
<b><a href="LOGORC1.html">LOGORC1</a> -- bitwise logical inclusive or of two ints, complementing the first
</b><br><br>
<b><a href="LOGORC2.html">LOGORC2</a> -- bitwise logical inclusive or of two ints, complementing the second
</b><br><br>
<b><a href="LOGTEST.html">LOGTEST</a> -- test if two integers share a `1' bit
</b><br><br>
<b><a href="LOGXOR.html">LOGXOR</a> -- bitwise logical exclusive or of zero or more integers
</b><br><br>
<b><a href="LOOP-STOPPER.html">LOOP-STOPPER</a> -- limit application of permutative rewrite rules
</b><br><br>
<b><a href="LOWER-CASE-P.html">LOWER-CASE-P</a> -- recognizer for lower case characters
</b><br><br>
<b><a href="LP.html">LP</a> -- the Common Lisp entry to ACL2
</b><br><br>
<BR><BR><H1><A NAME="M">M</A></H1>
<b><a href="MACRO-ALIASES-TABLE.html">MACRO-ALIASES-TABLE</a> -- a <a href="TABLE.html">table</a> used to associate function names with macro names
</b><br><br>
<b><a href="MACRO-ARGS.html">MACRO-ARGS</a> -- the formals list of a macro definition
</b><br><br>
<b><a href="MACRO-COMMAND.html">MACRO-COMMAND</a> -- compound command for the proof-checker
</b><br><br>
<b><a href="MAKE-CHARACTER-LIST.html">MAKE-CHARACTER-LIST</a> -- <a href="COERCE.html">coerce</a> to a list of characters
</b><br><br>
<b><a href="MAKE-EVENT.html">MAKE-EVENT</a> -- evaluate (expand) a given form and then evaluate the result
</b><br><br>
<b><a href="MAKE-EVENT-DETAILS.html">MAKE-EVENT-DETAILS</a> -- details on <code><a href="MAKE-EVENT.html">make-event</a></code> expansion
</b><br><br>
<b><a href="MAKE-LIST.html">MAKE-LIST</a> -- make a list of a given size
</b><br><br>
<b><a href="MAKE-ORD.html">MAKE-ORD</a> -- a constructor for ordinals.
</b><br><br>
<b><a href="MAKEFILES.html">MAKEFILES</a> -- See <a href="BOOK-MAKEFILES.html">book-makefiles</a>.
</b><br><br>
<b><a href="MARKUP.html">MARKUP</a> -- the markup language for ACL2 <a href="DOCUMENTATION.html">documentation</a> strings
</b><br><br>
<b><a href="MAX.html">MAX</a> -- the larger of two numbers
</b><br><br>
<b><a href="MAXIMUM-LENGTH.html">MAXIMUM-LENGTH</a> -- return the <code>:maximum-length</code> from the <a href="HEADER.html">header</a> of an array
</b><br><br>
<b><a href="MBE.html">MBE</a> -- attach code for execution
</b><br><br>
<b><a href="MBT.html">MBT</a> -- introduce a test not to be evaluated
</b><br><br>
<b><a href="MEASURE.html">MEASURE</a> -- xargs keyword <code>:MEASURE</code>
</b><br><br>
<b><a href="MEMBER.html">MEMBER</a> -- membership predicate, using <code><a href="EQL.html">eql</a></code> as test
</b><br><br>
<b><a href="MEMBER-EQ.html">MEMBER-EQ</a> -- membership predicate, using <code><a href="EQ.html">eq</a></code> as test
</b><br><br>
<b><a href="MEMBER-EQUAL.html">MEMBER-EQUAL</a> -- membership predicate
</b><br><br>
<b><a href="META.html">META</a> -- make a <code>:meta</code> rule (a hand-written simplifier)
</b><br><br>
<b><a href="MIN.html">MIN</a> -- the smaller of two numbers
</b><br><br>
<b><a href="MINIMAL-THEORY.html">MINIMAL-THEORY</a> -- a minimal theory to enable
</b><br><br>
<b><a href="MINUSP.html">MINUSP</a> -- test whether a number is negative
</b><br><br>
<b><a href="MISCELLANEOUS.html">MISCELLANEOUS</a> -- a miscellany of documented functions and concepts
<br><code> </code> (often cited in more accessible <a href="DOCUMENTATION.html">documentation</a>)
</b><br><br>
<b><a href="MOD.html">MOD</a> -- remainder using <code><a href="FLOOR.html">floor</a></code>
</b><br><br>
<b><a href="MOD-EXPT.html">MOD-EXPT</a> -- exponential function
</b><br><br>
<b><a href="MODE.html">MODE</a> -- xargs keyword <code>:MODE</code>
</b><br><br>
<b><a href="MONITOR.html">MONITOR</a> -- to monitor the attempted application of a rule name
</b><br><br>
<b><a href="MONITORED-RUNES.html">MONITORED-RUNES</a> -- print the <a href="MONITOR.html">monitor</a>ed <a href="RUNE.html">rune</a>s and their break conditions
</b><br><br>
<b><a href="MORE.html">MORE</a> -- your response to <code>:</code><code><a href="DOC.html">doc</a></code> or <code>:</code><code><a href="MORE.html">more</a></code>'s ``<code>(type :more...)</code>''
</b><br><br>
<b><a href="MORE_bang_.html">MORE!</a> -- another response to ``(type :more for more, :more! for the rest)''
</b><br><br>
<b><a href="MORE-DOC.html">MORE-DOC</a> -- a continuation of the <code>:</code><code><a href="DOC.html">doc</a></code> <a href="DOCUMENTATION.html">documentation</a>
</b><br><br>
<b><a href="MUST-BE-EQUAL.html">MUST-BE-EQUAL</a> -- attach code for execution
</b><br><br>
<b><a href="MUTUAL-RECURSION.html">MUTUAL-RECURSION</a> -- define some mutually recursive functions
</b><br><br>
<b><a href="MUTUAL-RECURSION-PROOF-EXAMPLE.html">MUTUAL-RECURSION-PROOF-EXAMPLE</a> -- a small proof about mutually recursive functions
</b><br><br>
<b><a href="MV.html">MV</a> -- returning a multiple value
</b><br><br>
<b><a href="MV-LET.html">MV-LET</a> -- calling multi-valued ACL2 functions
</b><br><br>
<b><a href="MV-NTH.html">MV-NTH</a> -- the mv-nth element (zero-based) of a list
</b><br><br>
<b><a href="Modeling_in_ACL2.html">Modeling in ACL2</a> -- Modeling in ACL2
</b><br><br>
<b><a href="Models_in_Engineering.html">Models in Engineering</a> -- Models in Engineering
</b><br><br>
<b><a href="Models_of_Computer_Hardware_and_Software.html">Models of Computer Hardware and Software</a> -- Models of Computer Hardware and Software
</b><br><br>
<BR><BR><H1><A NAME="N">N</A></H1>
<b><a href="NAME.html">NAME</a> -- syntactic rules on logical names
</b><br><br>
<b><a href="NATP.html">NATP</a> -- a recognizer for the natural numbers
</b><br><br>
<b><a href="NFIX.html">NFIX</a> -- coerce to a natural number
</b><br><br>
<b><a href="NINTH.html">NINTH</a> -- ninth member of the list
</b><br><br>
<b><a href="NO-DUPLICATESP.html">NO-DUPLICATESP</a> -- check for duplicates in a list (using <code>eql</code> for equality)
</b><br><br>
<b><a href="NO-DUPLICATESP-EQUAL.html">NO-DUPLICATESP-EQUAL</a> -- check for duplicates in a list (using <code>equal</code> for equality)
</b><br><br>
<b><a href="NON-EXECUTABLE.html">NON-EXECUTABLE</a> -- xargs keyword <code>:NON-EXECUTABLE</code>
</b><br><br>
<b><a href="NON-LINEAR-ARITHMETIC.html">NON-LINEAR-ARITHMETIC</a> -- Non-linear Arithmetic
</b><br><br>
<b><a href="NONLINEARP.html">NONLINEARP</a> -- hints keyword <code>:NONLINEARP</code>
</b><br><br>
<b><a href="NONNEGATIVE-INTEGER-QUOTIENT.html">NONNEGATIVE-INTEGER-QUOTIENT</a> -- natural number division function
</b><br><br>
<b><a href="NORMALIZE.html">NORMALIZE</a> -- xargs keyword <code>:NORMALIZE</code>
</b><br><br>
<b><a href="NOT.html">NOT</a> -- logical negation
</b><br><br>
<b><a href="NOTE-2-0.html">NOTE-2-0</a> -- ACL2 Version 2.0 (July, 1997) Notes
</b><br><br>
<b><a href="NOTE-2-1.html">NOTE-2-1</a> -- ACL2 Version 2.1 (December, 1997) Notes
</b><br><br>
<b><a href="NOTE-2-2.html">NOTE-2-2</a> -- ACL2 Version 2.2 (August, 1998) Notes
</b><br><br>
<b><a href="NOTE-2-3.html">NOTE-2-3</a> -- ACL2 Version 2.3 (October, 1998) Notes
</b><br><br>
<b><a href="NOTE-2-4.html">NOTE-2-4</a> -- ACL2 Version 2.4 (August, 1999) Notes
</b><br><br>
<b><a href="NOTE-2-5.html">NOTE-2-5</a> -- ACL2 Version 2.5 (June, 2000) Notes
</b><br><br>
<b><a href="NOTE-2-5_lparen_R_rparen_.html">NOTE-2-5(R)</a> -- ACL2 Version 2.5(r) (June, 2000) Notes
</b><br><br>
<b><a href="NOTE-2-6.html">NOTE-2-6</a> -- ACL2 Version 2.6 (November, 2001) Notes
</b><br><br>
<b><a href="NOTE-2-6_lparen_R_rparen_.html">NOTE-2-6(R)</a> -- ACL2 Version 2.6(r) (November, 2001) Notes
</b><br><br>
<b><a href="NOTE-2-6-GUARDS.html">NOTE-2-6-GUARDS</a> -- ACL2 Version 2.6 Notes on Guard-related Changes
</b><br><br>
<b><a href="NOTE-2-6-NEW-FUNCTIONALITY.html">NOTE-2-6-NEW-FUNCTIONALITY</a> -- ACL2 Version 2.6 Notes on New Functionality
</b><br><br>
<b><a href="NOTE-2-6-OTHER.html">NOTE-2-6-OTHER</a> -- ACL2 Version 2.6 Notes on Other (Minor) Changes
</b><br><br>
<b><a href="NOTE-2-6-PROOF-CHECKER.html">NOTE-2-6-PROOF-CHECKER</a> -- ACL2 Version 2.6 Notes on Proof-checker Changes
</b><br><br>
<b><a href="NOTE-2-6-PROOFS.html">NOTE-2-6-PROOFS</a> -- ACL2 Version 2.6 Notes on Changes in Proof Engine
</b><br><br>
<b><a href="NOTE-2-6-RULES.html">NOTE-2-6-RULES</a> -- ACL2 Version 2.6 Notes on Changes in Rules and Constants
</b><br><br>
<b><a href="NOTE-2-6-SYSTEM.html">NOTE-2-6-SYSTEM</a> -- ACL2 Version 2.6 Notes on System-level Changes
</b><br><br>
<b><a href="NOTE-2-7.html">NOTE-2-7</a> -- ACL2 Version 2.7 (November, 2002) Notes
</b><br><br>
<b><a href="NOTE-2-7_lparen_R_rparen_.html">NOTE-2-7(R)</a> -- ACL2 Version 2.7(r) (November, 2002) Notes
</b><br><br>
<b><a href="NOTE-2-7-BUG-FIXES.html">NOTE-2-7-BUG-FIXES</a> -- ACL2 Version 2.7 Notes on Bug Fixes
</b><br><br>
<b><a href="NOTE-2-7-GUARDS.html">NOTE-2-7-GUARDS</a> -- ACL2 Version 2.7 Notes on Guard-related Changes
</b><br><br>
<b><a href="NOTE-2-7-NEW-FUNCTIONALITY.html">NOTE-2-7-NEW-FUNCTIONALITY</a> -- ACL2 Version 2.7 Notes on New Functionality
</b><br><br>
<b><a href="NOTE-2-7-OTHER.html">NOTE-2-7-OTHER</a> -- ACL2 Version 2.7 Notes on Miscellaneous Changes
</b><br><br>
<b><a href="NOTE-2-7-PROOF-CHECKER.html">NOTE-2-7-PROOF-CHECKER</a> -- ACL2 Version 2.7 Notes on Proof-checker Changes
</b><br><br>
<b><a href="NOTE-2-7-PROOFS.html">NOTE-2-7-PROOFS</a> -- ACL2 Version 2.7 Notes on Changes in Proof Engine
</b><br><br>
<b><a href="NOTE-2-7-RULES.html">NOTE-2-7-RULES</a> -- ACL2 Version 2.7 Notes on Changes in Rules and Constants
</b><br><br>
<b><a href="NOTE-2-7-SYSTEM.html">NOTE-2-7-SYSTEM</a> -- ACL2 Version 2.7 Notes on System-level Changes
</b><br><br>
<b><a href="NOTE-2-8.html">NOTE-2-8</a> -- ACL2 Version 2.8 (March, 2004) Notes
</b><br><br>
<b><a href="NOTE-2-8_lparen_R_rparen_.html">NOTE-2-8(R)</a> -- ACL2 Version 2.8(r) (March, 2003) Notes
</b><br><br>
<b><a href="NOTE-2-8-BUG-FIXES.html">NOTE-2-8-BUG-FIXES</a> -- ACL2 Version 2.8 Notes on Bug Fixes
</b><br><br>
<b><a href="NOTE-2-8-GUARDS.html">NOTE-2-8-GUARDS</a> -- ACL2 Version 2.8 Notes on Guard-related Changes
</b><br><br>
<b><a href="NOTE-2-8-NEW-FUNCTIONALITY.html">NOTE-2-8-NEW-FUNCTIONALITY</a> -- ACL2 Version 2.8 Notes on New Functionality
</b><br><br>
<b><a href="NOTE-2-8-ORDINALS.html">NOTE-2-8-ORDINALS</a> -- ACL2 Version 2.8 Notes on Changes to the Ordinals
</b><br><br>
<b><a href="NOTE-2-8-OTHER.html">NOTE-2-8-OTHER</a> -- ACL2 Version 2.8 Notes on Miscellaneous Changes
</b><br><br>
<b><a href="NOTE-2-8-PROOF-CHECKER.html">NOTE-2-8-PROOF-CHECKER</a> -- ACL2 Version 2.8 Notes on Proof-checker Changes
</b><br><br>
<b><a href="NOTE-2-8-PROOFS.html">NOTE-2-8-PROOFS</a> -- ACL2 Version 2.8 Notes on Changes in Proof Engine
</b><br><br>
<b><a href="NOTE-2-8-RULES.html">NOTE-2-8-RULES</a> -- ACL2 Version 2.8 Notes on Changes in Rules, Definitions, and Constants
</b><br><br>
<b><a href="NOTE-2-8-SYSTEM.html">NOTE-2-8-SYSTEM</a> -- ACL2 Version 2.8 Notes on System-level Changes
</b><br><br>
<b><a href="NOTE-2-9.html">NOTE-2-9</a> -- ACL2 Version 2.9 (October, 2004) Notes
</b><br><br>
<b><a href="NOTE-2-9_lparen_R_rparen_.html">NOTE-2-9(R)</a> -- ACL2 Version 2.9(r) (October, 2004) Notes
</b><br><br>
<b><a href="NOTE-2-9-1.html">NOTE-2-9-1</a> -- ACL2 Version 2.9.1 (December, 2004) Notes
</b><br><br>
<b><a href="NOTE-2-9-2.html">NOTE-2-9-2</a> -- ACL2 Version 2.9.2 (April, 2005) Notes
</b><br><br>
<b><a href="NOTE-2-9-3.html">NOTE-2-9-3</a> -- ACL2 Version 2.9.3 (August, 2005) Notes
</b><br><br>
<b><a href="NOTE-2-9-3-PPR-CHANGE.html">NOTE-2-9-3-PPR-CHANGE</a> -- change in pretty-printing for ACL2 Version_2.9.3
</b><br><br>
<b><a href="NOTE-2-9-4.html">NOTE-2-9-4</a> -- ACL2 Version 2.9.4 (February, 2006) Notes
</b><br><br>
<b><a href="NOTE-2-9-5.html">NOTE-2-9-5</a> -- Changes in Version 3.0 since Version 2.9.4
</b><br><br>
<b><a href="NOTE-3-0.html">NOTE-3-0</a> -- ACL2 Version 3.0 (June, 2006) Notes
</b><br><br>
<b><a href="NOTE-3-0_lparen_R_rparen_.html">NOTE-3-0(R)</a> -- ACL2 Version 3.0(r) (June, 2006) Notes
</b><br><br>
<b><a href="NOTE-3-0-1.html">NOTE-3-0-1</a> -- ACL2 Version 3.0.1 (August, 2006) Notes
</b><br><br>
<b><a href="NOTE-3-0-1_lparen_R_rparen_.html">NOTE-3-0-1(R)</a> -- ACL2 Version 3.0.1(r) (August, 2006) Notes
</b><br><br>
<b><a href="NOTE-3-0-2.html">NOTE-3-0-2</a> -- ACL2 Version 3.0.2 (December, 2006) Notes
</b><br><br>
<b><a href="NOTE-3-1.html">NOTE-3-1</a> -- ACL2 Version 3.1 (December, 2006) Notes
</b><br><br>
<b><a href="NOTE-3-1_lparen_R_rparen_.html">NOTE-3-1(R)</a> -- ACL2 Version 3.1(r) (December, 2006) Notes
</b><br><br>
<b><a href="NOTE1.html">NOTE1</a> -- Acl2 Version 1.1 Notes
</b><br><br>
<b><a href="NOTE2.html">NOTE2</a> -- Acl2 Version 1.2 Notes
</b><br><br>
<b><a href="NOTE3.html">NOTE3</a> -- Acl2 Version 1.3 Notes
</b><br><br>
<b><a href="NOTE4.html">NOTE4</a> -- Acl2 Version 1.4 Notes
</b><br><br>
<b><a href="NOTE5.html">NOTE5</a> -- Acl2 Version 1.5 Notes
</b><br><br>
<b><a href="NOTE6.html">NOTE6</a> -- Acl2 Version 1.6 Notes
</b><br><br>
<b><a href="NOTE7.html">NOTE7</a> -- ACL2 Version 1.7 (released October 1994) Notes
</b><br><br>
<b><a href="NOTE8.html">NOTE8</a> -- ACL2 Version 1.8 (May, 1995) Notes
</b><br><br>
<b><a href="NOTE8-UPDATE.html">NOTE8-UPDATE</a> -- ACL2 Version 1.8 (Summer, 1995) Notes
</b><br><br>
<b><a href="NOTE9.html">NOTE9</a> -- ACL2 Version 1.9 (Fall, 1996) Notes
</b><br><br>
<b><a href="NQTHM-TO-ACL2.html">NQTHM-TO-ACL2</a> -- ACL2 analogues of Nqthm functions and commands
</b><br><br>
<b><a href="NTH.html">NTH</a> -- the nth element (zero-based) of a list
</b><br><br>
<b><a href="NTH-ALIASES-TABLE.html">NTH-ALIASES-TABLE</a> -- a <a href="TABLE.html">table</a> used to associate names for nth/update-nth printing
</b><br><br>
<b><a href="NTHCDR.html">NTHCDR</a> -- final segment of a list
</b><br><br>
<b><a href="NU-REWRITER.html">NU-REWRITER</a> -- rewriting <code>NTH</code>/<code>UPDATE-NTH</code> expressions
</b><br><br>
<b><a href="NULL.html">NULL</a> -- recognizer for the empty list
</b><br><br>
<b><a href="NUMERATOR.html">NUMERATOR</a> -- dividend of a ratio in lowest terms
</b><br><br>
<b><a href="Name_the_Formula_Above.html">Name the Formula Above</a> -- Name the Formula Above
</b><br><br>
<b><a href="Nontautological_Subgoals.html">Nontautological Subgoals</a> -- Prover output omits some details
</b><br><br>
<b><a href="Numbers_in_ACL2.html">Numbers in ACL2</a> -- Numbers in ACL2
</b><br><br>
<BR><BR><H1><A NAME="O">O</A></H1>
<b><a href="O-FINP.html">O-FINP</a> -- recognizes if an ordinal is finite
</b><br><br>
<b><a href="O-FIRST-COEFF.html">O-FIRST-COEFF</a> -- returns the first coefficient of an ordinal
</b><br><br>
<b><a href="O-FIRST-EXPT.html">O-FIRST-EXPT</a> -- the first exponent of an ordinal
</b><br><br>
<b><a href="O-INFP.html">O-INFP</a> -- recognizes if an ordinal is infinite
</b><br><br>
<b><a href="O-P.html">O-P</a> -- a recognizer for the ordinals up to epsilon-0
</b><br><br>
<b><a href="O-RST.html">O-RST</a> -- returns the rest of an infinite ordinal
</b><br><br>
<b><a href="O_lt_.html">O<</a> -- the well-founded less-than relation on ordinals up to <code>epsilon-0</code>
</b><br><br>
<b><a href="O_lt_=.html">O<=</a> -- the less-than-or-equal relation for the ordinals
</b><br><br>
<b><a href="O_gt_.html">O></a> -- the greater-than relation for the ordinals
</b><br><br>
<b><a href="O_gt_=.html">O>=</a> -- the greater-than-or-equal relation for the ordinals
</b><br><br>
<b><a href="OBDD.html">OBDD</a> -- ordered binary decision diagrams with rewriting
</b><br><br>
<b><a href="ODDP.html">ODDP</a> -- test whether an integer is odd
</b><br><br>
<b><a href="OK-IF.html">OK-IF</a> -- conditional exit from <code>break-rewrite</code>
</b><br><br>
<b><a href="OOPS.html">OOPS</a> -- undo a <code>:u</code> or <code>:</code><code><a href="UBT.html">ubt</a></code>
</b><br><br>
<b><a href="OPEN-INPUT-CHANNEL.html">OPEN-INPUT-CHANNEL</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="OPEN-INPUT-CHANNEL-P.html">OPEN-INPUT-CHANNEL-P</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="OPEN-OUTPUT-CHANNEL.html">OPEN-OUTPUT-CHANNEL</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="OPEN-OUTPUT-CHANNEL-P.html">OPEN-OUTPUT-CHANNEL-P</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="OPEN-TRACE-FILE.html">OPEN-TRACE-FILE</a> -- redirect trace output to a file
</b><br><br>
<b><a href="OR.html">OR</a> -- disjunction
</b><br><br>
<b><a href="ORDINALS.html">ORDINALS</a> -- ordinals in ACL2
</b><br><br>
<b><a href="OTF-FLG.html">OTF-FLG</a> -- pushing all the initial subgoals
</b><br><br>
<b><a href="OTHER.html">OTHER</a> -- other commonly used top-level functions
</b><br><br>
<b><a href="On_the_Naming_of_Subgoals.html">On the Naming of Subgoals</a> -- On the Naming of Subgoals
</b><br><br>
<b><a href="Other_Requirements.html">Other Requirements</a> -- Other Requirements
</b><br><br>
<b><a href="Overview_of_the_Expansion_of_ENDP_in_the_Base_Case.html">Overview of the Expansion of ENDP in the Base Case</a> -- Overview of the Expansion of ENDP in the Base Case
</b><br><br>
<b><a href="Overview_of_the_Expansion_of_ENDP_in_the_Induction_Step.html">Overview of the Expansion of ENDP in the Induction Step</a> -- Overview of the Expansion of ENDP in the Induction Step
</b><br><br>
<b><a href="Overview_of_the_Final_Simplification_in_the_Base_Case.html">Overview of the Final Simplification in the Base Case</a> -- Overview of the Final Simplification in the Base Case
</b><br><br>
<b><a href="Overview_of_the_Proof_of_a_Trivial_Consequence.html">Overview of the Proof of a Trivial Consequence</a> -- Overview of the Proof of a Trivial Consequence
</b><br><br>
<b><a href="Overview_of_the_Simplification_of_the_Base_Case_to_T.html">Overview of the Simplification of the Base Case to T</a> -- Overview of the Simplification of the Base Case to T
</b><br><br>
<b><a href="Overview_of_the_Simplification_of_the_Induction_Conclusion.html">Overview of the Simplification of the Induction Conclusion</a> -- Overview of the Simplification of the Induction Conclusion
</b><br><br>
<b><a href="Overview_of_the_Simplification_of_the_Induction_Step_to_T.html">Overview of the Simplification of the Induction Step to T</a> -- Overview of the Simplification of the Induction Step to T
</b><br><br>
<BR><BR><H1><A NAME="P">P</A></H1>
<b><a href="PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS.html">PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS</a> -- re-defining undone <code><a href="DEFPKG.html">defpkg</a></code>s
</b><br><br>
<b><a href="PAIRLIS.html">PAIRLIS</a> -- See <a href="PAIRLIS$.html">pairlis$</a>
</b><br><br>
<b><a href="PAIRLIS$.html">PAIRLIS$</a> -- zipper together two lists
</b><br><br>
<b><a href="PATHNAME.html">PATHNAME</a> -- introduction to filename conventions in ACL2
</b><br><br>
<b><a href="PBT.html">PBT</a> -- print the <a href="COMMAND.html">command</a>s back through a <a href="COMMAND.html">command</a> descriptor
</b><br><br>
<b><a href="PC.html">PC</a> -- print the <a href="COMMAND.html">command</a> described by a <a href="COMMAND.html">command</a> descriptor
</b><br><br>
<b><a href="PCB.html">PCB</a> -- print the <a href="COMMAND.html">command</a> block described by a <a href="COMMAND.html">command</a> descriptor
</b><br><br>
<b><a href="PCB_bang_.html">PCB!</a> -- print in full the <a href="COMMAND.html">command</a> block described by a <a href="COMMAND.html">command</a> descriptor
</b><br><br>
<b><a href="PCS.html">PCS</a> -- print the sequence of <a href="COMMAND.html">command</a>s between two <a href="COMMAND.html">command</a> descriptors
</b><br><br>
<b><a href="PE.html">PE</a> -- print the events named by a logical name
</b><br><br>
<b><a href="PE_bang_.html">PE!</a> -- deprecated (see <a href="PE.html">pe</a>)
</b><br><br>
<b><a href="PEEK-CHAR$.html">PEEK-CHAR$</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="PF.html">PF</a> -- print the formula corresponding to the given name
</b><br><br>
<b><a href="PKG-WITNESS.html">PKG-WITNESS</a> -- return a specific symbol in the indicated package
</b><br><br>
<b><a href="PL.html">PL</a> -- print the rules for the given name or term
</b><br><br>
<b><a href="PLUSP.html">PLUSP</a> -- test whether a number is positive
</b><br><br>
<b><a href="PORTCULLIS.html">PORTCULLIS</a> -- the gate guarding the entrance to a certified book
</b><br><br>
<b><a href="POSITION.html">POSITION</a> -- position of an item in a string or a list, using <code><a href="EQL.html">eql</a></code> as test
</b><br><br>
<b><a href="POSITION-EQ.html">POSITION-EQ</a> -- position of an item in a string or a list, using <code><a href="EQ.html">eq</a></code> as test
</b><br><br>
<b><a href="POSITION-EQUAL.html">POSITION-EQUAL</a> -- position of an item in a string or a list
</b><br><br>
<b><a href="POSP.html">POSP</a> -- a recognizer for the positive integers
</b><br><br>
<b><a href="PPROGN.html">PPROGN</a> -- evaluate a sequence of forms that return <a href="STATE.html">state</a>
</b><br><br>
<b><a href="PR.html">PR</a> -- print the rules stored by the event with the given name
</b><br><br>
<b><a href="PR_bang_.html">PR!</a> -- print rules stored by the command with a given command descriptor
</b><br><br>
<b><a href="PRINC$.html">PRINC$</a> -- print a string
</b><br><br>
<b><a href="PRINT-DOC-START-COLUMN.html">PRINT-DOC-START-COLUMN</a> -- printing the one-liner
</b><br><br>
<b><a href="PRINT-OBJECT$.html">PRINT-OBJECT$</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="PROG2$.html">PROG2$</a> -- execute two forms and return the value of the second one
</b><br><br>
<b><a href="PROGN.html">PROGN</a> -- evaluate some <a href="EVENTS.html">events</a>
</b><br><br>
<b><a href="PROGN_bang_.html">PROGN!</a> -- evaluate some forms, not necessarily <a href="EVENTS.html">events</a>
</b><br><br>
<b><a href="PROGRAM.html">PROGRAM</a> -- to set the default <a href="DEFUN-MODE.html">defun-mode</a> to <code>:</code><code><a href="PROGRAM.html">program</a></code>
</b><br><br>
<b><a href="PROGRAMMING.html">PROGRAMMING</a> -- built-in ACL2 functions
</b><br><br>
<b><a href="PROMPT.html">PROMPT</a> -- the prompt printed by <code><a href="LD.html">ld</a></code>
</b><br><br>
<b><a href="PROOF-CHECKER.html">PROOF-CHECKER</a> -- support for low-level interaction
</b><br><br>
<b><a href="PROOF-CHECKER-COMMANDS.html">PROOF-CHECKER-COMMANDS</a> -- list of commands for the proof-checker
</b><br><br>
<b><a href="PROOF-OF-WELL-FOUNDEDNESS.html">PROOF-OF-WELL-FOUNDEDNESS</a> -- a proof that <code><a href="O_lt_.html">o<</a></code> is well-founded on <code><a href="O-P.html">o-p</a></code>s
</b><br><br>
<b><a href="PROOF-TREE.html">PROOF-TREE</a> -- proof tree displays
</b><br><br>
<b><a href="PROOF-TREE-BINDINGS.html">PROOF-TREE-BINDINGS</a> -- using emacs with proof trees
</b><br><br>
<b><a href="PROOF-TREE-DETAILS.html">PROOF-TREE-DETAILS</a> -- proof tree details not covered elsewhere
</b><br><br>
<b><a href="PROOF-TREE-EMACS.html">PROOF-TREE-EMACS</a> -- using emacs with proof trees
</b><br><br>
<b><a href="PROOF-TREE-EXAMPLES.html">PROOF-TREE-EXAMPLES</a> -- proof tree example
</b><br><br>
<b><a href="PROOFS-CO.html">PROOFS-CO</a> -- the proofs character output channel
</b><br><br>
<b><a href="PROPER-CONSP.html">PROPER-CONSP</a> -- recognizer for proper (null-terminated) non-empty lists
</b><br><br>
<b><a href="PROPS.html">PROPS</a> -- print the ACL2 properties on a symbol
</b><br><br>
<b><a href="PSEUDO-TERMP.html">PSEUDO-TERMP</a> -- a predicate for recognizing term-like s-expressions
</b><br><br>
<b><a href="PSO.html">PSO</a> -- show the most recently saved output
</b><br><br>
<b><a href="PSO_bang_.html">PSO!</a> -- show the most recently saved output, including <a href="PROOF-TREE.html">proof-tree</a> output
</b><br><br>
<b><a href="PSTACK.html">PSTACK</a> -- seeing what is the prover up to
</b><br><br>
<b><a href="PUFF.html">PUFF</a> -- replace a compound <a href="COMMAND.html">command</a> by its immediate subevents
</b><br><br>
<b><a href="PUFF_star_.html">PUFF*</a> -- replace a compound <a href="COMMAND.html">command</a> by its subevents
</b><br><br>
<b><a href="PUSH-UNTOUCHABLE.html">PUSH-UNTOUCHABLE</a> -- add name or list of names to the list of untouchable symbols
</b><br><br>
<b><a href="PUT-ASSOC-EQ.html">PUT-ASSOC-EQ</a> -- modify an association list by associating a value with a key
</b><br><br>
<b><a href="PUT-ASSOC-EQL.html">PUT-ASSOC-EQL</a> -- modify an association list by associating a value with a key
</b><br><br>
<b><a href="PUT-ASSOC-EQUAL.html">PUT-ASSOC-EQUAL</a> -- modify an association list by associating a value with a key
</b><br><br>
<b><a href="Pages_Written_Especially_for_the_Tours.html">Pages Written Especially for the Tours</a> -- Pages Written Especially for the Tours
</b><br><br>
<b><a href="Perhaps.html">Perhaps</a> -- Perhaps
</b><br><br>
<b><a href="Popping_out_of_an_Inductive_Proof.html">Popping out of an Inductive Proof</a> -- Popping out of an Inductive Proof
</b><br><br>
<b><a href="Proving_Theorems_about_Models.html">Proving Theorems about Models</a> -- Proving Theorems about Models
</b><br><br>
<BR><BR><H1><A NAME="Q">Q</A></H1>
<b><a href="Q.html">Q</a> -- quit ACL2 (type <code>:q</code>) -- reenter with <code>(lp)</code>
</b><br><br>
<b><a href="QUANTIFIERS.html">QUANTIFIERS</a> -- issues about quantification in ACL2
</b><br><br>
<b><a href="QUANTIFIERS-USING-DEFUN-SK.html">QUANTIFIERS-USING-DEFUN-SK</a> -- quantification example
</b><br><br>
<b><a href="QUANTIFIERS-USING-DEFUN-SK-EXTENDED.html">QUANTIFIERS-USING-DEFUN-SK-EXTENDED</a> -- quantification example with details
</b><br><br>
<b><a href="QUANTIFIERS-USING-RECURSION.html">QUANTIFIERS-USING-RECURSION</a> -- recursion for implementing quantification
</b><br><br>
<b><a href="QUIT.html">QUIT</a> -- quit entirely out of Lisp
</b><br><br>
<BR><BR><H1><A NAME="R">R</A></H1>
<b><a href="RASSOC.html">RASSOC</a> -- look up value in association list, using <code><a href="EQL.html">eql</a></code> as test
</b><br><br>
<b><a href="RASSOC-EQ.html">RASSOC-EQ</a> -- look up value in association list, using <code><a href="EQ.html">eq</a></code> as test
</b><br><br>
<b><a href="RASSOC-EQUAL.html">RASSOC-EQUAL</a> -- look up value in association list, using <code><a href="EQUAL.html">equal</a></code> as test
</b><br><br>
<b><a href="RATIONAL-LISTP.html">RATIONAL-LISTP</a> -- recognizer for a true list of rational numbers
</b><br><br>
<b><a href="RATIONALP.html">RATIONALP</a> -- recognizer for rational numbers (ratios and integers)
</b><br><br>
<b><a href="READ-BYTE$.html">READ-BYTE$</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="READ-CHAR$.html">READ-CHAR$</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="READ-OBJECT.html">READ-OBJECT</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="REAL.html">REAL</a> -- ACL2(r) support for real numbers
</b><br><br>
<b><a href="REAL-LISTP.html">REAL-LISTP</a> -- ACL2(r) recognizer for a true list of real numbers
</b><br><br>
<b><a href="REAL_slash_RATIONALP.html">REAL/RATIONALP</a> -- recognizer for rational numbers (including real number in ACL2(r))
</b><br><br>
<b><a href="REALFIX.html">REALFIX</a> -- coerce to a real number
</b><br><br>
<b><a href="REALPART.html">REALPART</a> -- real part of a complex number
</b><br><br>
<b><a href="REBUILD.html">REBUILD</a> -- a convenient way to reconstruct your old <a href="STATE.html">state</a>
</b><br><br>
<b><a href="REDEF.html">REDEF</a> -- a common way to set <a href="LD-REDEFINITION-ACTION.html">ld-redefinition-action</a>
</b><br><br>
<b><a href="REDEF_bang_.html">REDEF!</a> -- system hacker's redefinition <a href="COMMAND.html">command</a>
</b><br><br>
<b><a href="REDEFINED-NAMES.html">REDEFINED-NAMES</a> -- to collect the names that have been redefined
</b><br><br>
<b><a href="REDEFINING-PROGRAMS.html">REDEFINING-PROGRAMS</a> -- an explanation of why we restrict redefinitions
</b><br><br>
<b><a href="REDO-FLAT.html">REDO-FLAT</a> -- redo up through a failure in an <code><a href="ENCAPSULATE.html">encapsulate</a></code> or <code><a href="PROGN.html">progn</a></code>
</b><br><br>
<b><a href="REDUNDANT-EVENTS.html">REDUNDANT-EVENTS</a> -- allowing a name to be introduced ``twice''
</b><br><br>
<b><a href="REFINEMENT.html">REFINEMENT</a> -- record that one equivalence relation refines another
</b><br><br>
<b><a href="RELEASE-NOTES.html">RELEASE-NOTES</a> -- pointers to what has changed
</b><br><br>
<b><a href="REM.html">REM</a> -- remainder using <code><a href="TRUNCATE.html">truncate</a></code>
</b><br><br>
<b><a href="REMOVE.html">REMOVE</a> -- remove all occurrences, testing using <code><a href="EQL.html">eql</a></code>
</b><br><br>
<b><a href="REMOVE-BINOP.html">REMOVE-BINOP</a> -- remove the association of a binary function name with a macro name
</b><br><br>
<b><a href="REMOVE-DEFAULT-HINTS.html">REMOVE-DEFAULT-HINTS</a> -- remove from the default hints
</b><br><br>
<b><a href="REMOVE-DEFAULT-HINTS_bang_.html">REMOVE-DEFAULT-HINTS!</a> -- remove from the default hints non-<code><a href="LOCAL.html">local</a></code>ly
</b><br><br>
<b><a href="REMOVE-DIVE-INTO-MACRO.html">REMOVE-DIVE-INTO-MACRO</a> -- removes association of <a href="PROOF-CHECKER.html">proof-checker</a> diving function with macro name
</b><br><br>
<b><a href="REMOVE-DUPLICATES.html">REMOVE-DUPLICATES</a> -- remove duplicates from a string or (using <code><a href="EQL.html">eql</a></code>) a list
</b><br><br>
<b><a href="REMOVE-DUPLICATES-EQUAL.html">REMOVE-DUPLICATES-EQUAL</a> -- remove duplicates from a list
</b><br><br>
<b><a href="REMOVE-EQ.html">REMOVE-EQ</a> -- remove all occurrences, testing using <code><a href="EQ.html">eq</a></code>
</b><br><br>
<b><a href="REMOVE-EQUAL.html">REMOVE-EQUAL</a> -- remove all occurrences, testing using <code><a href="EQUAL.html">equal</a></code>
</b><br><br>
<b><a href="REMOVE-INVISIBLE-FNS.html">REMOVE-INVISIBLE-FNS</a> -- make some unary functions no longer invisible
</b><br><br>
<b><a href="REMOVE-MACRO-ALIAS.html">REMOVE-MACRO-ALIAS</a> -- remove the association of a function name with a macro name
</b><br><br>
<b><a href="REMOVE-NTH-ALIAS.html">REMOVE-NTH-ALIAS</a> -- remove the association of one symbol with another for printing of <code><a href="NTH.html">nth</a></code>/<code><a href="UPDATE-NTH.html">update-nth</a></code> terms
</b><br><br>
<b><a href="REMOVE-RAW-ARITY.html">REMOVE-RAW-ARITY</a> -- remove arity information for raw mode
</b><br><br>
<b><a href="REMOVE-UNTOUCHABLE.html">REMOVE-UNTOUCHABLE</a> -- remove name or list of names to the list of untouchable symbols
</b><br><br>
<b><a href="REMOVE1.html">REMOVE1</a> -- remove first occurrences, testing using <code><a href="EQL.html">eql</a></code>
</b><br><br>
<b><a href="REMOVE1-EQ.html">REMOVE1-EQ</a> -- remove first occurrences, testing using <code><a href="EQ.html">eq</a></code>
</b><br><br>
<b><a href="REMOVE1-EQUAL.html">REMOVE1-EQUAL</a> -- remove first occurrences, testing using <code><a href="EQUAL.html">equal</a></code>
</b><br><br>
<b><a href="RESET-KILL-RING.html">RESET-KILL-RING</a> -- save memory by resetting and perhaps resizing the kill ring used by <code><a href="OOPS.html">oops</a></code>
</b><br><br>
<b><a href="RESET-LD-SPECIALS.html">RESET-LD-SPECIALS</a> -- restores initial settings of the <code><a href="LD.html">ld</a></code> specials
</b><br><br>
<b><a href="RESET-PREHISTORY.html">RESET-PREHISTORY</a> -- reset the prehistory
</b><br><br>
<b><a href="RESIZE-LIST.html">RESIZE-LIST</a> -- list resizer in support of stobjs
</b><br><br>
<b><a href="REST.html">REST</a> -- rest (<code><a href="CDR.html">cdr</a></code>) of the list
</b><br><br>
<b><a href="RESTRICT.html">RESTRICT</a> -- hints keyword <code>:RESTRICT</code>
</b><br><br>
<b><a href="RETRIEVE.html">RETRIEVE</a> -- re-enter a (specified) <a href="PROOF-CHECKER.html">proof-checker</a> state
</b><br><br>
<b><a href="REVAPPEND.html">REVAPPEND</a> -- concatentate the <a href="REVERSE.html">reverse</a> of one list to another
</b><br><br>
<b><a href="REVERSE.html">REVERSE</a> -- reverse a list or string
</b><br><br>
<b><a href="REWRITE.html">REWRITE</a> -- make some <code>:rewrite</code> rules (possibly conditional ones)
</b><br><br>
<b><a href="REWRITE-STACK-LIMIT.html">REWRITE-STACK-LIMIT</a> -- limiting the stack depth of the ACL2 rewriter
</b><br><br>
<b><a href="RFIX.html">RFIX</a> -- coerce to a rational number
</b><br><br>
<b><a href="ROUND.html">ROUND</a> -- division returning an integer by rounding off
</b><br><br>
<b><a href="RULE-CLASSES.html">RULE-CLASSES</a> -- adding rules to the data base
</b><br><br>
<b><a href="RULE-NAMES.html">RULE-NAMES</a> -- How rules are named.
</b><br><br>
<b><a href="RUNE.html">RUNE</a> -- a rule name
</b><br><br>
<b><a href="Revisiting_the_Admission_of_App.html">Revisiting the Admission of App</a> -- Revisiting the Admission of App
</b><br><br>
<b><a href="Rewrite_Rules_are_Generated_from_DEFTHM_Events.html">Rewrite Rules are Generated from DEFTHM Events</a> -- Rewrite Rules are Generated from DEFTHM Events
</b><br><br>
<b><a href="Running_Models.html">Running Models</a> -- Running Models
</b><br><br>
<BR><BR><H1><A NAME="S">S</A></H1>
<b><a href="SAVE-EXEC.html">SAVE-EXEC</a> -- save an executable image and (for most Common Lisps) a wrapper script
</b><br><br>
<b><a href="SAVING-AND-RESTORING.html">SAVING-AND-RESTORING</a> -- saving and restoring your logical state
</b><br><br>
<b><a href="SECOND.html">SECOND</a> -- second member of the list
</b><br><br>
<b><a href="SET-ACL2-PRINT-BASE.html">SET-ACL2-PRINT-BASE</a> -- control radix in which number are printed
</b><br><br>
<b><a href="SET-ACL2-PRINT-CASE.html">SET-ACL2-PRINT-CASE</a> -- control whether symbols are printed in upper case or in lower case
</b><br><br>
<b><a href="SET-BACKCHAIN-LIMIT.html">SET-BACKCHAIN-LIMIT</a> -- Sets the backchain-limit used by the rewriter
</b><br><br>
<b><a href="SET-BODY.html">SET-BODY</a> -- set the definition body
</b><br><br>
<b><a href="SET-BOGUS-MUTUAL-RECURSION-OK.html">SET-BOGUS-MUTUAL-RECURSION-OK</a> -- allow unnecessary ``mutual recursion''
</b><br><br>
<b><a href="SET-BRR-TERM-EVISC-TUPLE.html">SET-BRR-TERM-EVISC-TUPLE</a> -- controls printing of terms inside the <a href="BREAK-REWRITE.html">break-rewrite</a> loop
</b><br><br>
<b><a href="SET-CASE-SPLIT-LIMITATIONS.html">SET-CASE-SPLIT-LIMITATIONS</a> -- set the case-split-limitations
</b><br><br>
<b><a href="SET-CBD.html">SET-CBD</a> -- to set the connected book directory
</b><br><br>
<b><a href="SET-COMPILE-FNS.html">SET-COMPILE-FNS</a> -- have each function compiled as you go along.
</b><br><br>
<b><a href="SET-DEFAULT-BACKCHAIN-LIMIT.html">SET-DEFAULT-BACKCHAIN-LIMIT</a> -- sets the default backchain-limit used when admitting a rule
</b><br><br>
<b><a href="SET-DEFAULT-HINTS.html">SET-DEFAULT-HINTS</a> -- set the default hints
</b><br><br>
<b><a href="SET-DEFAULT-HINTS_bang_.html">SET-DEFAULT-HINTS!</a> -- set the default hints non-<code><a href="LOCAL.html">local</a></code>ly
</b><br><br>
<b><a href="SET-DIFFERENCE-EQ.html">SET-DIFFERENCE-EQ</a> -- elements of one list that are not elements of another
</b><br><br>
<b><a href="SET-DIFFERENCE-EQUAL.html">SET-DIFFERENCE-EQUAL</a> -- elements of one list that are not elements of another
</b><br><br>
<b><a href="SET-DIFFERENCE-THEORIES.html">SET-DIFFERENCE-THEORIES</a> -- difference of two <a href="THEORIES.html">theories</a>
</b><br><br>
<b><a href="SET-ENFORCE-REDUNDANCY.html">SET-ENFORCE-REDUNDANCY</a> -- require most events to be redundant
</b><br><br>
<b><a href="SET-GUARD-CHECKING.html">SET-GUARD-CHECKING</a> -- control checking <a href="GUARD.html">guard</a>s during execution of top-level forms
</b><br><br>
<b><a href="SET-IGNORE-OK.html">SET-IGNORE-OK</a> -- allow unused formals and locals without an <code>ignore</code> or <code>ignorable</code> declaration
</b><br><br>
<b><a href="SET-INHIBIT-OUTPUT-LST.html">SET-INHIBIT-OUTPUT-LST</a> -- control output
</b><br><br>
<b><a href="SET-INHIBIT-WARNINGS.html">SET-INHIBIT-WARNINGS</a> -- control warnings
</b><br><br>
<b><a href="SET-INVISIBLE-FNS-TABLE.html">SET-INVISIBLE-FNS-TABLE</a> -- set the invisible functions table
</b><br><br>
<b><a href="SET-IRRELEVANT-FORMALS-OK.html">SET-IRRELEVANT-FORMALS-OK</a> -- allow irrelevant formals in definitions
</b><br><br>
<b><a href="SET-LD-REDEFINITION-ACTION.html">SET-LD-REDEFINITION-ACTION</a> -- See <a href="LD-REDEFINITION-ACTION.html">ld-redefinition-action</a>.
</b><br><br>
<b><a href="SET-LD-SKIP-PROOFSP.html">SET-LD-SKIP-PROOFSP</a> -- See <a href="LD-SKIP-PROOFSP.html">ld-skip-proofsp</a>.
</b><br><br>
<b><a href="SET-LET_star_-ABSTRACTIONP.html">SET-LET*-ABSTRACTIONP</a> -- to shorten many prettyprinted clauses
</b><br><br>
<b><a href="SET-MATCH-FREE-DEFAULT.html">SET-MATCH-FREE-DEFAULT</a> -- provide default for <code>:match-free</code> in future rules
</b><br><br>
<b><a href="SET-MATCH-FREE-ERROR.html">SET-MATCH-FREE-ERROR</a> -- control error vs. warning when <code>:match-free</code> is missing
</b><br><br>
<b><a href="SET-MEASURE-FUNCTION.html">SET-MEASURE-FUNCTION</a> -- set the default measure function symbol
</b><br><br>
<b><a href="SET-NON-LINEARP.html">SET-NON-LINEARP</a> -- to turn on or off non-linear arithmetic reasoning
</b><br><br>
<b><a href="SET-NU-REWRITER-MODE.html">SET-NU-REWRITER-MODE</a> -- to turn on and off the nu-rewriter
</b><br><br>
<b><a href="SET-PRINT-CLAUSE-IDS.html">SET-PRINT-CLAUSE-IDS</a> -- cause subgoal numbers to be printed when <code>'prove</code> output is inhibited
</b><br><br>
<b><a href="SET-RAW-MODE.html">SET-RAW-MODE</a> -- enter or exit ``raw mode,'' a raw Lisp environment
</b><br><br>
<b><a href="SET-RAW-MODE-ON_bang_.html">SET-RAW-MODE-ON!</a> -- enter ``raw mode,'' a raw Lisp environment
</b><br><br>
<b><a href="SET-REWRITE-STACK-LIMIT.html">SET-REWRITE-STACK-LIMIT</a> -- Sets the rewrite stack depth used by the rewriter
</b><br><br>
<b><a href="SET-SAVED-OUTPUT.html">SET-SAVED-OUTPUT</a> -- save proof output for later display with <code>:</code><code><a href="PSO.html">pso</a></code> or <code>:</code><code><a href="PSO_bang_.html">pso!</a></code>
</b><br><br>
<b><a href="SET-STATE-OK.html">SET-STATE-OK</a> -- allow the use of STATE as a formal parameter
</b><br><br>
<b><a href="SET-TAINTED-OKP.html">SET-TAINTED-OKP</a> -- control output
</b><br><br>
<b><a href="SET-VERIFY-GUARDS-EAGERNESS.html">SET-VERIFY-GUARDS-EAGERNESS</a> -- the eagerness with which <a href="GUARD.html">guard</a> verification is tried.
</b><br><br>
<b><a href="SET-WELL-FOUNDED-RELATION.html">SET-WELL-FOUNDED-RELATION</a> -- set the default well-founded relation
</b><br><br>
<b><a href="SETENV$.html">SETENV$</a> -- set an environment variable
</b><br><br>
<b><a href="SEVENTH.html">SEVENTH</a> -- seventh member of the list
</b><br><br>
<b><a href="SHOW-BDD.html">SHOW-BDD</a> -- inspect failed BDD proof attempts
</b><br><br>
<b><a href="SHOW-BODIES.html">SHOW-BODIES</a> -- show the potential definition bodies
</b><br><br>
<b><a href="SIGNATURE.html">SIGNATURE</a> -- how to specify the arity of a constrained function
</b><br><br>
<b><a href="SIGNUM.html">SIGNUM</a> -- indicator for positive, negative, or zero
</b><br><br>
<b><a href="SIMPLE.html">SIMPLE</a> -- <code>:</code><code><a href="DEFINITION.html">definition</a></code> and <code>:</code><code><a href="REWRITE.html">rewrite</a></code> rules used in preprocessing
</b><br><br>
<b><a href="SIXTH.html">SIXTH</a> -- sixth member of the list
</b><br><br>
<b><a href="SKIP-PROOFS.html">SKIP-PROOFS</a> -- skip proofs for a given form -- a quick way to introduce unsoundness
</b><br><br>
<b><a href="SLOW-ARRAY-WARNING.html">SLOW-ARRAY-WARNING</a> -- a warning issued when <a href="ARRAYS.html">arrays</a> are used inefficiently
</b><br><br>
<b><a href="SOLUTION-TO-SIMPLE-EXAMPLE.html">SOLUTION-TO-SIMPLE-EXAMPLE</a> -- solution to a simple example
</b><br><br>
<b><a href="SPECIOUS-SIMPLIFICATION.html">SPECIOUS-SIMPLIFICATION</a> -- nonproductive proof steps
</b><br><br>
<b><a href="STANDARD-CHAR-LISTP.html">STANDARD-CHAR-LISTP</a> -- recognizer for a true list of standard characters
</b><br><br>
<b><a href="STANDARD-CHAR-P.html">STANDARD-CHAR-P</a> -- recognizer for standard characters
</b><br><br>
<b><a href="STANDARD-CO.html">STANDARD-CO</a> -- the character output channel to which <code><a href="LD.html">ld</a></code> prints
</b><br><br>
<b><a href="STANDARD-NUMBERP.html">STANDARD-NUMBERP</a> -- ACL2(r) recognizer for standard numbers
</b><br><br>
<b><a href="STANDARD-OI.html">STANDARD-OI</a> -- the standard object input ``channel''
</b><br><br>
<b><a href="STANDARD-PART.html">STANDARD-PART</a> -- ACL2(r) function mapping limited numbers to standard numbers
</b><br><br>
<b><a href="STANDARD-STRING-ALISTP.html">STANDARD-STRING-ALISTP</a> -- recognizer for association lists with standard strings as keys
</b><br><br>
<b><a href="START-PROOF-TREE.html">START-PROOF-TREE</a> -- start displaying proof trees during proofs
</b><br><br>
<b><a href="STARTUP.html">STARTUP</a> -- How to start using ACL2; the ACL2 <a href="COMMAND.html">command</a> loop
</b><br><br>
<b><a href="STATE.html">STATE</a> -- the von Neumannesque ACL2 state object
</b><br><br>
<b><a href="STOBJ.html">STOBJ</a> -- single-threaded objects or ``von Neumann bottlenecks''
</b><br><br>
<b><a href="STOBJ-EXAMPLE-1.html">STOBJ-EXAMPLE-1</a> -- an example of the use of single-threaded objects
</b><br><br>
<b><a href="STOBJ-EXAMPLE-1-DEFUNS.html">STOBJ-EXAMPLE-1-DEFUNS</a> -- the defuns created by the <code>counters</code> stobj
</b><br><br>
<b><a href="STOBJ-EXAMPLE-1-IMPLEMENTATION.html">STOBJ-EXAMPLE-1-IMPLEMENTATION</a> -- the implementation of the <code>counters</code> stobj
</b><br><br>
<b><a href="STOBJ-EXAMPLE-1-PROOFS.html">STOBJ-EXAMPLE-1-PROOFS</a> -- some proofs involving the <code>counters</code> stobj
</b><br><br>
<b><a href="STOBJ-EXAMPLE-2.html">STOBJ-EXAMPLE-2</a> -- an example of the use of arrays in single-threaded objects
</b><br><br>
<b><a href="STOBJ-EXAMPLE-3.html">STOBJ-EXAMPLE-3</a> -- another example of a single-threaded object
</b><br><br>
<b><a href="STOBJS.html">STOBJS</a> -- xargs keyword <code>:STOBJS</code>
</b><br><br>
<b><a href="STOP-PROOF-TREE.html">STOP-PROOF-TREE</a> -- stop displaying proof trees during proofs
</b><br><br>
<b><a href="STRING.html">STRING</a> -- <a href="COERCE.html">coerce</a> to a string
</b><br><br>
<b><a href="STRING-APPEND.html">STRING-APPEND</a> -- <a href="CONCATENATE.html">concatenate</a> two strings
</b><br><br>
<b><a href="STRING-DOWNCASE.html">STRING-DOWNCASE</a> -- in a given string, turn upper-case <a href="CHARACTERS.html">characters</a> into lower-case
</b><br><br>
<b><a href="STRING-EQUAL.html">STRING-EQUAL</a> -- string equality without regard to case
</b><br><br>
<b><a href="STRING-LISTP.html">STRING-LISTP</a> -- recognizer for a true list of strings
</b><br><br>
<b><a href="STRING-UPCASE.html">STRING-UPCASE</a> -- in a given string, turn lower-case <a href="CHARACTERS.html">characters</a> into upper-case
</b><br><br>
<b><a href="STRING_lt_.html">STRING<</a> -- less-than test for strings
</b><br><br>
<b><a href="STRING_lt_=.html">STRING<=</a> -- less-than-or-equal test for strings
</b><br><br>
<b><a href="STRING_gt_.html">STRING></a> -- greater-than test for strings
</b><br><br>
<b><a href="STRING_gt_=.html">STRING>=</a> -- less-than-or-equal test for strings
</b><br><br>
<b><a href="STRINGP.html">STRINGP</a> -- recognizer for strings
</b><br><br>
<b><a href="STRIP-CARS.html">STRIP-CARS</a> -- collect up all first components of pairs in a list
</b><br><br>
<b><a href="STRIP-CDRS.html">STRIP-CDRS</a> -- collect up all second components of pairs in a list
</b><br><br>
<b><a href="SUBLIS.html">SUBLIS</a> -- substitute an alist into a tree
</b><br><br>
<b><a href="SUBSEQ.html">SUBSEQ</a> -- subsequence of a string or list
</b><br><br>
<b><a href="SUBSETP.html">SUBSETP</a> -- test if every <code><a href="MEMBER.html">member</a></code> of one list is a <code><a href="MEMBER.html">member</a></code> of the other
</b><br><br>
<b><a href="SUBSETP-EQUAL.html">SUBSETP-EQUAL</a> -- check if all members of one list are members of the other
</b><br><br>
<b><a href="SUBST.html">SUBST</a> -- a single substitution into a tree
</b><br><br>
<b><a href="SUBSTITUTE.html">SUBSTITUTE</a> -- substitute into a string or a list, using <code><a href="EQL.html">eql</a></code> as test
</b><br><br>
<b><a href="SUBVERSIVE-INDUCTIONS.html">SUBVERSIVE-INDUCTIONS</a> -- why we restrict <a href="ENCAPSULATE.html">encapsulate</a>d recursive functions
</b><br><br>
<b><a href="SUBVERSIVE-RECURSIONS.html">SUBVERSIVE-RECURSIONS</a> -- why we restrict <a href="ENCAPSULATE.html">encapsulate</a>d recursive functions
</b><br><br>
<b><a href="SYMBOL-_lt_.html">SYMBOL-<</a> -- less-than test for symbols
</b><br><br>
<b><a href="SYMBOL-ALISTP.html">SYMBOL-ALISTP</a> -- recognizer for association lists with symbols as keys
</b><br><br>
<b><a href="SYMBOL-LISTP.html">SYMBOL-LISTP</a> -- recognizer for a true list of symbols
</b><br><br>
<b><a href="SYMBOL-NAME.html">SYMBOL-NAME</a> -- the name of a symbol (a string)
</b><br><br>
<b><a href="SYMBOL-PACKAGE-NAME.html">SYMBOL-PACKAGE-NAME</a> -- the name of the package of a symbol (a string)
</b><br><br>
<b><a href="SYMBOLP.html">SYMBOLP</a> -- recognizer for symbols
</b><br><br>
<b><a href="SYNTAX.html">SYNTAX</a> -- the syntax of ACL2 is that of Common Lisp
</b><br><br>
<b><a href="SYNTAXP.html">SYNTAXP</a> -- attach a heuristic filter on a <code>:</code><code><a href="REWRITE.html">rewrite</a></code>, <code>:</code><code><a href="META.html">meta</a></code>, or <code>:</code><code><a href="LINEAR.html">linear</a></code> rule
</b><br><br>
<b><a href="SYNTAXP-EXAMPLES.html">SYNTAXP-EXAMPLES</a> -- examples pertaining to syntaxp hypotheses
</b><br><br>
<b><a href="SYS-CALL.html">SYS-CALL</a> -- make a system call to the host operating system
</b><br><br>
<b><a href="SYS-CALL-STATUS.html">SYS-CALL-STATUS</a> -- exit status from the preceding system call
</b><br><br>
<b><a href="Subsumption_of_Induction_Candidates_in_App_Example.html">Subsumption of Induction Candidates in App Example</a> -- Subsumption of Induction Candidates in App Example
</b><br><br>
<b><a href="Suggested_Inductions_in_the_Associativity_of_App_Example.html">Suggested Inductions in the Associativity of App Example</a> -- Suggested Inductions in the Associativity of App Example
</b><br><br>
<b><a href="Symbolic_Execution_of_Models.html">Symbolic Execution of Models</a> -- Symbolic Execution of Models
</b><br><br>
<BR><BR><H1><A NAME="T">T</A></H1>
<b><a href="TABLE.html">TABLE</a> -- user-managed tables
</b><br><br>
<b><a href="TAKE.html">TAKE</a> -- initial segment of a list
</b><br><br>
<b><a href="TENTH.html">TENTH</a> -- tenth member of the list
</b><br><br>
<b><a href="TERM.html">TERM</a> -- the three senses of well-formed ACL2 expressions or formulas
</b><br><br>
<b><a href="TERM-ORDER.html">TERM-ORDER</a> -- the ordering relation on terms used by ACL2
</b><br><br>
<b><a href="TERM-TABLE.html">TERM-TABLE</a> -- a table used to validate meta rules
</b><br><br>
<b><a href="THE.html">THE</a> -- run-time type check
</b><br><br>
<b><a href="THE-METHOD.html">THE-METHOD</a> -- how to find proofs
</b><br><br>
<b><a href="THEORIES.html">THEORIES</a> -- sets of <a href="RUNE.html">rune</a>s to enable/disable in concert
</b><br><br>
<b><a href="THEORY.html">THEORY</a> -- retrieve named theory
</b><br><br>
<b><a href="THEORY-FUNCTIONS.html">THEORY-FUNCTIONS</a> -- functions for obtaining or producing <a href="THEORIES.html">theories</a>
</b><br><br>
<b><a href="THEORY-INVARIANT.html">THEORY-INVARIANT</a> -- user-specified invariants on <a href="THEORIES.html">theories</a>
</b><br><br>
<b><a href="THIRD.html">THIRD</a> -- third member of the list
</b><br><br>
<b><a href="THM.html">THM</a> -- prove a theorem
</b><br><br>
<b><a href="TIDBITS.html">TIDBITS</a> -- some basic hints for using ACL2
</b><br><br>
<b><a href="TIME$.html">TIME$</a> -- time a form
</b><br><br>
<b><a href="TIPS.html">TIPS</a> -- some hints for using the ACL2 prover
</b><br><br>
<b><a href="TOGGLE-PC-MACRO.html">TOGGLE-PC-MACRO</a> -- change an ordinary macro command to an atomic macro, or vice-versa
</b><br><br>
<b><a href="TRACE.html">TRACE</a> -- tracing functions in ACL2
</b><br><br>
<b><a href="TRACE$.html">TRACE$</a> -- trace the indicated functions
</b><br><br>
<b><a href="TRANS.html">TRANS</a> -- print the macroexpansion of a form
</b><br><br>
<b><a href="TRANS_bang_.html">TRANS!</a> -- print the macroexpansion of a form without single-threadedness concerns
</b><br><br>
<b><a href="TRANS1.html">TRANS1</a> -- print the one-step macroexpansion of a form
</b><br><br>
<b><a href="TRUE-LIST-LISTP.html">TRUE-LIST-LISTP</a> -- recognizer for true (proper) lists of true lists
</b><br><br>
<b><a href="TRUE-LISTP.html">TRUE-LISTP</a> -- recognizer for proper (null-terminated) lists
</b><br><br>
<b><a href="TRUNCATE.html">TRUNCATE</a> -- division returning an integer by truncating toward 0
</b><br><br>
<b><a href="TTAGS-SEEN.html">TTAGS-SEEN</a> -- list some declared trust tags (ttags)
</b><br><br>
<b><a href="TTREE.html">TTREE</a> -- tag trees
</b><br><br>
<b><a href="TUTORIAL-EXAMPLES.html">TUTORIAL-EXAMPLES</a> -- examples of ACL2 usage
</b><br><br>
<b><a href="TUTORIAL1-TOWERS-OF-HANOI.html">TUTORIAL1-TOWERS-OF-HANOI</a> -- The Towers of Hanoi Example
</b><br><br>
<b><a href="TUTORIAL2-EIGHTS-PROBLEM.html">TUTORIAL2-EIGHTS-PROBLEM</a> -- The Eights Problem Example
</b><br><br>
<b><a href="TUTORIAL3-PHONEBOOK-EXAMPLE.html">TUTORIAL3-PHONEBOOK-EXAMPLE</a> -- A Phonebook Specification
</b><br><br>
<b><a href="TUTORIAL4-DEFUN-SK-EXAMPLE.html">TUTORIAL4-DEFUN-SK-EXAMPLE</a> -- example of quantified notions
</b><br><br>
<b><a href="TUTORIAL5-MISCELLANEOUS-EXAMPLES.html">TUTORIAL5-MISCELLANEOUS-EXAMPLES</a> -- miscellaneous ACL2 examples
</b><br><br>
<b><a href="TYPE-PRESCRIPTION.html">TYPE-PRESCRIPTION</a> -- make a rule that specifies the type of a term
</b><br><br>
<b><a href="TYPE-SET.html">TYPE-SET</a> -- how type information is encoded in ACL2
</b><br><br>
<b><a href="TYPE-SET-INVERTER.html">TYPE-SET-INVERTER</a> -- exhibit a new decoding for an ACL2 type-set
</b><br><br>
<b><a href="TYPE-SPEC.html">TYPE-SPEC</a> -- type specifiers in declarations
</b><br><br>
<b><a href="The_Admission_of_App.html">The Admission of App</a> -- The Admission of App
</b><br><br>
<b><a href="The_Associativity_of_App.html">The Associativity of App</a> -- The Associativity of App
</b><br><br>
<b><a href="The_Base_Case_in_the_App_Example.html">The Base Case in the App Example</a> -- The Base Case in the App Example
</b><br><br>
<b><a href="The_End_of_the_Flying_Tour.html">The End of the Flying Tour</a> -- The End of the Flying Tour
</b><br><br>
<b><a href="The_End_of_the_Proof_of_the_Associativity_of_App.html">The End of the Proof of the Associativity of App</a> -- The End of the Proof of the Associativity of App
</b><br><br>
<b><a href="The_End_of_the_Walking_Tour.html">The End of the Walking Tour</a> -- The End of the Walking Tour
</b><br><br>
<b><a href="The_Event_Summary.html">The Event Summary</a> -- The Event Summary
</b><br><br>
<b><a href="The_Expansion_of_ENDP_in_the_Induction_Step__lparen_Step_0_rparen_.html">The Expansion of ENDP in the Induction Step (Step 0)</a> -- The Expansion of ENDP in the Induction Step (Step 0)
</b><br><br>
<b><a href="The_Expansion_of_ENDP_in_the_Induction_Step__lparen_Step_1_rparen_.html">The Expansion of ENDP in the Induction Step (Step 1)</a> -- The Expansion of ENDP in the Induction Step (Step 1)
</b><br><br>
<b><a href="The_Expansion_of_ENDP_in_the_Induction_Step__lparen_Step_2_rparen_.html">The Expansion of ENDP in the Induction Step (Step 2)</a> -- The Expansion of ENDP in the Induction Step (Step 2)
</b><br><br>
<b><a href="The_Falling_Body_Model.html">The Falling Body Model</a> -- The Falling Body Model
</b><br><br>
<b><a href="The_Final_Simplification_in_the_Base_Case__lparen_Step_0_rparen_.html">The Final Simplification in the Base Case (Step 0)</a> -- the Final Simplification in the Base Case (Step 0)
</b><br><br>
<b><a href="The_Final_Simplification_in_the_Base_Case__lparen_Step_1_rparen_.html">The Final Simplification in the Base Case (Step 1)</a> -- the Final Simplification in the Base Case (Step 1)
</b><br><br>
<b><a href="The_Final_Simplification_in_the_Base_Case__lparen_Step_2_rparen_.html">The Final Simplification in the Base Case (Step 2)</a> -- the Final Simplification in the Base Case (Step 2)
</b><br><br>
<b><a href="The_Final_Simplification_in_the_Base_Case__lparen_Step_3_rparen_.html">The Final Simplification in the Base Case (Step 3)</a> -- the Final Simplification in the Base Case (Step 3)
</b><br><br>
<b><a href="The_First_Application_of_the_Associativity_Rule.html">The First Application of the Associativity Rule</a> -- The First Application of the Associativity Rule
</b><br><br>
<b><a href="The_Induction_Scheme_Selected_for_the_App_Example.html">The Induction Scheme Selected for the App Example</a> -- The Induction Scheme Selected for the App Example
</b><br><br>
<b><a href="The_Induction_Step_in_the_App_Example.html">The Induction Step in the App Example</a> -- The Induction Step in the App Example
</b><br><br>
<b><a href="The_Instantiation_of_the_Induction_Scheme.html">The Instantiation of the Induction Scheme</a> -- The Instantiation of the Induction Scheme
</b><br><br>
<b><a href="The_Justification_of_the_Induction_Scheme.html">The Justification of the Induction Scheme</a> -- The Justification of the Induction Scheme
</b><br><br>
<b><a href="The_Proof_of_the_Associativity_of_App.html">The Proof of the Associativity of App</a> -- The Proof of the Associativity of App
</b><br><br>
<b><a href="The_Q.E.D._Message.html">The Q.E.D. Message</a> -- The Q.E.D. Message
</b><br><br>
<b><a href="The_Rules_used_in_the_Associativity_of_App_Proof.html">The Rules used in the Associativity of App Proof</a> -- The Rules used in the Associativity of App Proof
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_0_rparen_.html">The Simplification of the Induction Conclusion (Step 0)</a> -- the Simplification of the Induction Conclusion (Step 0)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_1_rparen_.html">The Simplification of the Induction Conclusion (Step 1)</a> -- the Simplification of the Induction Conclusion (Step 1)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_10_rparen_.html">The Simplification of the Induction Conclusion (Step 10)</a> -- the Simplification of the Induction Conclusion (Step 10)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_11_rparen_.html">The Simplification of the Induction Conclusion (Step 11)</a> -- the Simplification of the Induction Conclusion (Step 11)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_12_rparen_.html">The Simplification of the Induction Conclusion (Step 12)</a> -- the Simplification of the Induction Conclusion (Step 12)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_2_rparen_.html">The Simplification of the Induction Conclusion (Step 2)</a> -- the Simplification of the Induction Conclusion (Step 2)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_3_rparen_.html">The Simplification of the Induction Conclusion (Step 3)</a> -- the Simplification of the Induction Conclusion (Step 3)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_4_rparen_.html">The Simplification of the Induction Conclusion (Step 4)</a> -- the Simplification of the Induction Conclusion (Step 4)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_5_rparen_.html">The Simplification of the Induction Conclusion (Step 5)</a> -- the Simplification of the Induction Conclusion (Step 5)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_6_rparen_.html">The Simplification of the Induction Conclusion (Step 6)</a> -- the Simplification of the Induction Conclusion (Step 6)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_7_rparen_.html">The Simplification of the Induction Conclusion (Step 7)</a> -- the Simplification of the Induction Conclusion (Step 7)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_8_rparen_.html">The Simplification of the Induction Conclusion (Step 8)</a> -- the Simplification of the Induction Conclusion (Step 8)
</b><br><br>
<b><a href="The_Simplification_of_the_Induction_Conclusion__lparen_Step_9_rparen_.html">The Simplification of the Induction Conclusion (Step 9)</a> -- the Simplification of the Induction Conclusion (Step 9)
</b><br><br>
<b><a href="The_Summary_of_the_Proof_of_the_Trivial_Consequence.html">The Summary of the Proof of the Trivial Consequence</a> -- The Summary of the Proof of the Trivial Consequence
</b><br><br>
<b><a href="The_Theorem_that_App_is_Associative.html">The Theorem that App is Associative</a> -- The Theorem that App is Associative
</b><br><br>
<b><a href="The_Time_Taken_to_do_the_Associativity_of_App_Proof.html">The Time Taken to do the Associativity of App Proof</a> -- The Time Taken to do the Associativity of App Proof
</b><br><br>
<b><a href="The_Tours.html">The Tours</a> -- The Tours
</b><br><br>
<b><a href="The_WARNING_about_the_Trivial_Consequence.html">The WARNING about the Trivial Consequence</a> -- The WARNING about the Trivial Consequence
</b><br><br>
<BR><BR><H1><A NAME="U">U</A></H1>
<b><a href="U.html">U</a> -- undo last <a href="COMMAND.html">command</a>, without a query
</b><br><br>
<b><a href="UBT.html">UBT</a> -- undo the <a href="COMMAND.html">command</a>s back through a <a href="COMMAND.html">command</a> descriptor
</b><br><br>
<b><a href="UBT_bang_.html">UBT!</a> -- undo <a href="COMMAND.html">command</a>s, without a query or an error
</b><br><br>
<b><a href="UBT-PREHISTORY.html">UBT-PREHISTORY</a> -- undo the <a href="COMMAND.html">command</a>s back through the last <code><a href="RESET-PREHISTORY.html">reset-prehistory</a></code> event
</b><br><br>
<b><a href="UBU.html">UBU</a> -- undo the <a href="COMMAND.html">command</a>s back up to (not including) a <a href="COMMAND.html">command</a> descriptor
</b><br><br>
<b><a href="UBU_bang_.html">UBU!</a> -- undo <a href="COMMAND.html">command</a>s, without a query or an error
</b><br><br>
<b><a href="UNARY--.html">UNARY--</a> -- arithmetic negation function
</b><br><br>
<b><a href="UNARY-_slash_.html">UNARY-/</a> -- reciprocal function
</b><br><br>
<b><a href="UNCERTIFIED-BOOKS.html">UNCERTIFIED-BOOKS</a> -- invalid <a href="CERTIFICATE.html">certificate</a>s and uncertified <a href="BOOKS.html">books</a>
</b><br><br>
<b><a href="UNION-EQ.html">UNION-EQ</a> -- union of two lists of symbols
</b><br><br>
<b><a href="UNION-EQUAL.html">UNION-EQUAL</a> -- union of two lists
</b><br><br>
<b><a href="UNION-THEORIES.html">UNION-THEORIES</a> -- union two <a href="THEORIES.html">theories</a>
</b><br><br>
<b><a href="UNIVERSAL-THEORY.html">UNIVERSAL-THEORY</a> -- all rules as of logical name
</b><br><br>
<b><a href="UNMONITOR.html">UNMONITOR</a> -- to stop monitoring a rule name
</b><br><br>
<b><a href="UNSAVE.html">UNSAVE</a> -- remove a <a href="PROOF-CHECKER.html">proof-checker</a> state
</b><br><br>
<b><a href="UNTRACE$.html">UNTRACE$</a> -- untrace functions
</b><br><br>
<b><a href="UNTRANSLATE.html">UNTRANSLATE</a> -- See <a href="USER-DEFINED-FUNCTIONS-TABLE.html">user-defined-functions-table</a>.
</b><br><br>
<b><a href="UPDATE-NTH.html">UPDATE-NTH</a> -- modify a list by putting the given value at the given position
</b><br><br>
<b><a href="UPPER-CASE-P.html">UPPER-CASE-P</a> -- recognizer for upper case characters
</b><br><br>
<b><a href="USE.html">USE</a> -- hints keyword <code>:USE</code>
</b><br><br>
<b><a href="USER-DEFINED-FUNCTIONS-TABLE.html">USER-DEFINED-FUNCTIONS-TABLE</a> -- an advanced <a href="TABLE.html">table</a> used to replace certain system functions
</b><br><br>
<b><a href="USING-COMPUTED-HINTS.html">USING-COMPUTED-HINTS</a> -- how to use computed hints
</b><br><br>
<b><a href="USING-COMPUTED-HINTS-1.html">USING-COMPUTED-HINTS-1</a> -- Driving Home the Basics
</b><br><br>
<b><a href="USING-COMPUTED-HINTS-2.html">USING-COMPUTED-HINTS-2</a> -- One Hint to Every Top-Level Goal in a Forcing Round
</b><br><br>
<b><a href="USING-COMPUTED-HINTS-3.html">USING-COMPUTED-HINTS-3</a> -- Hints as a Function of the Goal (not its Name)
</b><br><br>
<b><a href="USING-COMPUTED-HINTS-4.html">USING-COMPUTED-HINTS-4</a> -- Computing the Hints
</b><br><br>
<b><a href="USING-COMPUTED-HINTS-5.html">USING-COMPUTED-HINTS-5</a> -- Debugging Computed Hints
</b><br><br>
<b><a href="USING-COMPUTED-HINTS-6.html">USING-COMPUTED-HINTS-6</a> -- Using the computed-hint-replacement feature
</b><br><br>
<b><a href="USING-COMPUTED-HINTS-7.html">USING-COMPUTED-HINTS-7</a> -- Using the <code>stable-under-simplificationp</code> flag
</b><br><br>
<b><a href="USING-COMPUTED-HINTS-8.html">USING-COMPUTED-HINTS-8</a> -- Some Final Comments
</b><br><br>
<b><a href="Undocumented_Topic.html">Undocumented Topic</a> -- Undocumented Topic
</b><br><br>
<b><a href="Using_the_Associativity_of_App_to_Prove_a_Trivial_Consequence.html">Using the Associativity of App to Prove a Trivial Consequence</a> -- Using the Associativity of App to Prove a Trivial Consequence
</b><br><br>
<BR><BR><H1><A NAME="V">V</A></H1>
<b><a href="VERBOSE-PSTACK.html">VERBOSE-PSTACK</a> -- seeing what is the prover up to (for advanced users)
</b><br><br>
<b><a href="VERIFY.html">VERIFY</a> -- enter the interactive proof checker
</b><br><br>
<b><a href="VERIFY-GUARDS.html">VERIFY-GUARDS</a> -- verify the <a href="GUARD.html">guard</a>s of a function
</b><br><br>
<b><a href="VERIFY-TERMINATION.html">VERIFY-TERMINATION</a> -- convert a function from :program mode to :logic mode
</b><br><br>
<b><a href="VERSION.html">VERSION</a> -- ACL2 Version Number
</b><br><br>
<BR><BR><H1><A NAME="W">W</A></H1>
<b><a href="WELL-FOUNDED-RELATION.html">WELL-FOUNDED-RELATION</a> -- show that a relation is well-founded on a set
</b><br><br>
<b><a href="WET.html">WET</a> -- evaluate a form and print subsequent error trace
</b><br><br>
<b><a href="WHY-BRR.html">WHY-BRR</a> -- an explanation of why ACL2 has an explicit <code><a href="BRR.html">brr</a></code> mode
</b><br><br>
<b><a href="WITH-ERROR-TRACE.html">WITH-ERROR-TRACE</a> -- evaluate a form and print subsequent error trace
</b><br><br>
<b><a href="WITH-LOCAL-STOBJ.html">WITH-LOCAL-STOBJ</a> -- locally bind a single-threaded object
</b><br><br>
<b><a href="WITH-OUTPUT.html">WITH-OUTPUT</a> -- suppressing or turning on specified output for an event
</b><br><br>
<b><a href="WITH-PROVER-TIME-LIMIT.html">WITH-PROVER-TIME-LIMIT</a> -- limit the time for proofs
</b><br><br>
<b><a href="WORLD.html">WORLD</a> -- ACL2 property lists and the ACL2 logical data base
</b><br><br>
<b><a href="WORMHOLE.html">WORMHOLE</a> -- <code><a href="LD.html">ld</a></code> without <code><a href="STATE.html">state</a></code> -- a short-cut to a parallel universe
</b><br><br>
<b><a href="WORMHOLE-P.html">WORMHOLE-P</a> -- predicate to determine if you are inside a <code><a href="WORMHOLE.html">wormhole</a></code>
</b><br><br>
<b><a href="WRITE-BYTE$.html">WRITE-BYTE$</a> -- See <a href="IO.html">io</a>.
</b><br><br>
<b><a href="What_Is_ACL2_lparen_Q_rparen_.html">What Is ACL2(Q)</a> -- What Is ACL2?
</b><br><br>
<b><a href="What_is_Required_of_the_User_lparen_Q_rparen_.html">What is Required of the User(Q)</a> -- What is Required of the User?
</b><br><br>
<b><a href="What_is_a_Mathematical_Logic_lparen_Q_rparen_.html">What is a Mathematical Logic(Q)</a> -- What is a Mathematical Logic?
</b><br><br>
<b><a href="What_is_a_Mechanical_Theorem_Prover_lparen_Q_rparen_.html">What is a Mechanical Theorem Prover(Q)</a> -- What is a Mechanical Theorem Prover?
</b><br><br>
<b><a href="What_is_a_Mechanical_Theorem_Prover_lparen_Q_rparen___lparen_cont_rparen_.html">What is a Mechanical Theorem Prover(Q) (cont)</a> -- What is a Mechanical Theorem Prover? (cont)
</b><br><br>
<BR><BR><H1><A NAME="X">X</A></H1>
<b><a href="XARGS.html">XARGS</a> -- giving <a href="HINTS.html">hints</a> to <code><a href="DEFUN.html">defun</a></code>
</b><br><br>
<BR><BR><H1><A NAME="Y">Y</A></H1>
<b><a href="You_Must_Think_about_the_Use_of_a_Formula_as_a_Rule.html">You Must Think about the Use of a Formula as a Rule</a> -- You Must Think about the Use of a Formula as a Rule
</b><br><br>
<BR><BR><H1><A NAME="Z">Z</A></H1>
<b><a href="ZERO-TEST-IDIOMS.html">ZERO-TEST-IDIOMS</a> -- how to test for 0
</b><br><br>
<b><a href="ZEROP.html">ZEROP</a> -- test an acl2-number against 0
</b><br><br>
<b><a href="ZIP.html">ZIP</a> -- testing an ``integer'' against 0
</b><br><br>
<b><a href="ZP.html">ZP</a> -- testing a ``natural'' against 0
</b><br><br>
<b><a href="ZPF.html">ZPF</a> -- testing a nonnegative fixnum against 0
</b><br><br>
<BR><BR><H1><A NAME="ACL2-PC::">ACL2-PC::</A></H1>
<b><a href="ACL2-PC_colon__colon_=.html">ACL2-PC::=</a> -- (atomic macro)
<br><code> </code>attempt an equality (or equivalence) substitution
</b><br><br>
<b><a href="ACL2-PC_colon__colon_ACL2-WRAP.html">ACL2-PC::ACL2-WRAP</a> -- (macro)
<br><code> </code>same as <code>(lisp x)</code>
</b><br><br>
<b><a href="ACL2-PC_colon__colon_ADD-ABBREVIATION.html">ACL2-PC::ADD-ABBREVIATION</a> -- (primitive)
<br><code> </code>add an abbreviation
</b><br><br>
<b><a href="ACL2-PC_colon__colon_BASH.html">ACL2-PC::BASH</a> -- (atomic macro)
<br><code> </code>call the ACL2 theorem prover's simplifier
</b><br><br>
<b><a href="ACL2-PC_colon__colon_BDD.html">ACL2-PC::BDD</a> -- (atomic macro)
<br><code> </code>prove the current goal using bdds
</b><br><br>
<b><a href="ACL2-PC_colon__colon_BK.html">ACL2-PC::BK</a> -- (atomic macro)
<br><code> </code>move backward one argument in the enclosing term
</b><br><br>
<b><a href="ACL2-PC_colon__colon_BOOKMARK.html">ACL2-PC::BOOKMARK</a> -- (macro)
<br><code> </code>insert matching ``bookends'' comments
</b><br><br>
<b><a href="ACL2-PC_colon__colon_CASESPLIT.html">ACL2-PC::CASESPLIT</a> -- (primitive)
<br><code> </code>split into two cases
</b><br><br>
<b><a href="ACL2-PC_colon__colon_CG.html">ACL2-PC::CG</a> -- (macro)
<br><code> </code>change to another goal.
</b><br><br>
<b><a href="ACL2-PC_colon__colon_CHANGE-GOAL.html">ACL2-PC::CHANGE-GOAL</a> -- (primitive)
<br><code> </code>change to another goal.
</b><br><br>
<b><a href="ACL2-PC_colon__colon_CLAIM.html">ACL2-PC::CLAIM</a> -- (atomic macro)
<br><code> </code>add a new hypothesis
</b><br><br>
<b><a href="ACL2-PC_colon__colon_COMM.html">ACL2-PC::COMM</a> -- (macro)
<br><code> </code>display instructions from the current interactive session
</b><br><br>
<b><a href="ACL2-PC_colon__colon_COMMANDS.html">ACL2-PC::COMMANDS</a> -- (macro)
<br><code> </code>display instructions from the current interactive session
</b><br><br>
<b><a href="ACL2-PC_colon__colon_COMMENT.html">ACL2-PC::COMMENT</a> -- (primitive)
<br><code> </code>insert a comment
</b><br><br>
<b><a href="ACL2-PC_colon__colon_CONTRADICT.html">ACL2-PC::CONTRADICT</a> -- (macro)
<br><code> </code>same as <code>contrapose</code>
</b><br><br>
<b><a href="ACL2-PC_colon__colon_CONTRAPOSE.html">ACL2-PC::CONTRAPOSE</a> -- (primitive)
<br><code> </code>switch a hypothesis with the conclusion, negating both
</b><br><br>
<b><a href="ACL2-PC_colon__colon_DEMOTE.html">ACL2-PC::DEMOTE</a> -- (primitive)
<br><code> </code>move top-level hypotheses to the conclusion
</b><br><br>
<b><a href="ACL2-PC_colon__colon_DIVE.html">ACL2-PC::DIVE</a> -- (primitive)
<br><code> </code>move to the indicated subterm
</b><br><br>
<b><a href="ACL2-PC_colon__colon_DO-ALL.html">ACL2-PC::DO-ALL</a> -- (macro)
<br><code> </code>run the given instructions
</b><br><br>
<b><a href="ACL2-PC_colon__colon_DO-ALL-NO-PROMPT.html">ACL2-PC::DO-ALL-NO-PROMPT</a> -- (macro)
<br><code> </code>run the given instructions, halting once there is a ``failure''
</b><br><br>
<b><a href="ACL2-PC_colon__colon_DO-STRICT.html">ACL2-PC::DO-STRICT</a> -- (macro)
<br><code> </code>run the given instructions, halting once there is a ``failure''
</b><br><br>
<b><a href="ACL2-PC_colon__colon_DROP.html">ACL2-PC::DROP</a> -- (primitive)
<br><code> </code>drop top-level hypotheses
</b><br><br>
<b><a href="ACL2-PC_colon__colon_DV.html">ACL2-PC::DV</a> -- (atomic macro)
<br><code> </code>move to the indicated subterm
</b><br><br>
<b><a href="ACL2-PC_colon__colon_ELIM.html">ACL2-PC::ELIM</a> -- (atomic macro)
<br><code> </code>call the ACL2 theorem prover's elimination process
</b><br><br>
<b><a href="ACL2-PC_colon__colon_EQUIV.html">ACL2-PC::EQUIV</a> -- (primitive)
<br><code> </code>attempt an equality (or congruence-based) substitution
</b><br><br>
<b><a href="ACL2-PC_colon__colon_EX.html">ACL2-PC::EX</a> -- (macro)
<br><code> </code>exit after possibly saving the state
</b><br><br>
<b><a href="ACL2-PC_colon__colon_EXIT.html">ACL2-PC::EXIT</a> -- (meta)
<br><code> </code>exit the interactive proof-checker
</b><br><br>
<b><a href="ACL2-PC_colon__colon_EXPAND.html">ACL2-PC::EXPAND</a> -- (primitive)
<br><code> </code>expand the current function call without simplification
</b><br><br>
<b><a href="ACL2-PC_colon__colon_FAIL.html">ACL2-PC::FAIL</a> -- (macro)
<br><code> </code>cause a failure
</b><br><br>
<b><a href="ACL2-PC_colon__colon_FORWARDCHAIN.html">ACL2-PC::FORWARDCHAIN</a> -- (atomic macro)
<br><code> </code>forward chain from an implication in the hyps
</b><br><br>
<b><a href="ACL2-PC_colon__colon_FREE.html">ACL2-PC::FREE</a> -- (atomic macro)
<br><code> </code>create a ``free variable''
</b><br><br>
<b><a href="ACL2-PC_colon__colon_GENERALIZE.html">ACL2-PC::GENERALIZE</a> -- (primitive)
<br><code> </code>perform a generalization
</b><br><br>
<b><a href="ACL2-PC_colon__colon_GOALS.html">ACL2-PC::GOALS</a> -- (macro)
<br><code> </code>list the names of goals on the stack
</b><br><br>
<b><a href="ACL2-PC_colon__colon_HELP.html">ACL2-PC::HELP</a> -- (macro)
<br><code> </code>proof-checker help facility
</b><br><br>
<b><a href="ACL2-PC_colon__colon_HELP_bang_.html">ACL2-PC::HELP!</a> -- (macro)
<br><code> </code>proof-checker help facility
</b><br><br>
<b><a href="ACL2-PC_colon__colon_HELP-LONG.html">ACL2-PC::HELP-LONG</a> -- (macro)
<br><code> </code>same as <code>help!</code>
</b><br><br>
<b><a href="ACL2-PC_colon__colon_HYPS.html">ACL2-PC::HYPS</a> -- (macro)
<br><code> </code>print the hypotheses
</b><br><br>
<b><a href="ACL2-PC_colon__colon_ILLEGAL.html">ACL2-PC::ILLEGAL</a> -- (macro)
<br><code> </code>illegal instruction
</b><br><br>
<b><a href="ACL2-PC_colon__colon_IN-THEORY.html">ACL2-PC::IN-THEORY</a> -- (primitive)
<br><code> </code>set the current proof-checker theory
</b><br><br>
<b><a href="ACL2-PC_colon__colon_INDUCT.html">ACL2-PC::INDUCT</a> -- (atomic macro)
<br><code> </code>generate subgoals using induction
</b><br><br>
<b><a href="ACL2-PC_colon__colon_LEMMAS-USED.html">ACL2-PC::LEMMAS-USED</a> -- (macro)
<br><code> </code>print the runes (definitions, lemmas, ...) used
</b><br><br>
<b><a href="ACL2-PC_colon__colon_LISP.html">ACL2-PC::LISP</a> -- (meta)
<br><code> </code>evaluate the given form in Lisp
</b><br><br>
<b><a href="ACL2-PC_colon__colon_MORE.html">ACL2-PC::MORE</a> -- (macro)
<br><code> </code>proof-checker help facility
</b><br><br>
<b><a href="ACL2-PC_colon__colon_MORE_bang_.html">ACL2-PC::MORE!</a> -- (macro)
<br><code> </code>proof-checker help facility
</b><br><br>
<b><a href="ACL2-PC_colon__colon_NEGATE.html">ACL2-PC::NEGATE</a> -- (macro)
<br><code> </code>run the given instructions, and ``succeed'' if and only if they ``fail''
</b><br><br>
<b><a href="ACL2-PC_colon__colon_NIL.html">ACL2-PC::NIL</a> -- (macro)
<br><code> </code>used for interpreting <code>control-d</code>
</b><br><br>
<b><a href="ACL2-PC_colon__colon_NOISE.html">ACL2-PC::NOISE</a> -- (meta)
<br><code> </code>run instructions with output
</b><br><br>
<b><a href="ACL2-PC_colon__colon_NX.html">ACL2-PC::NX</a> -- (atomic macro)
<br><code> </code>move forward one argument in the enclosing term
</b><br><br>
<b><a href="ACL2-PC_colon__colon_ORELSE.html">ACL2-PC::ORELSE</a> -- (macro)
<br><code> </code>run the first instruction; if (and only if) it ``fails'', run the
<br><code> </code>second
</b><br><br>
<b><a href="ACL2-PC_colon__colon_P.html">ACL2-PC::P</a> -- (macro)
<br><code> </code>prettyprint the current term
</b><br><br>
<b><a href="ACL2-PC_colon__colon_P-TOP.html">ACL2-PC::P-TOP</a> -- (macro)
<br><code> </code>prettyprint the conclusion, highlighting the current term
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PP.html">ACL2-PC::PP</a> -- (macro)
<br><code> </code>prettyprint the current term
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PRINT.html">ACL2-PC::PRINT</a> -- (macro)
<br><code> </code>print the result of evaluating the given form
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PRINT-ALL-CONCS.html">ACL2-PC::PRINT-ALL-CONCS</a> -- (macro)
<br><code> </code>print all the conclusions of (as yet unproved) goals
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PRINT-ALL-GOALS.html">ACL2-PC::PRINT-ALL-GOALS</a> -- (macro)
<br><code> </code>print all the (as yet unproved) goals
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PRINT-MAIN.html">ACL2-PC::PRINT-MAIN</a> -- (macro)
<br><code> </code>print the original goal
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PRO.html">ACL2-PC::PRO</a> -- (atomic macro)
<br><code> </code>repeatedly apply promote
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PROMOTE.html">ACL2-PC::PROMOTE</a> -- (primitive)
<br><code> </code>move antecedents of conclusion's <code>implies</code> term to top-level
<br><code> </code>hypotheses
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PROTECT.html">ACL2-PC::PROTECT</a> -- (macro)
<br><code> </code>run the given instructions, reverting to existing state upon
<br><code> </code>failure
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PROVE.html">ACL2-PC::PROVE</a> -- (primitive)
<br><code> </code>call the ACL2 theorem prover to prove the current goal
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PSO.html">ACL2-PC::PSO</a> -- (macro)
<br><code> </code>print the most recent proof attempt from inside the proof-checker
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PSO_bang_.html">ACL2-PC::PSO!</a> -- (macro)
<br><code> </code>print the most recent proof attempt from inside the proof-checker
</b><br><br>
<b><a href="ACL2-PC_colon__colon_PUT.html">ACL2-PC::PUT</a> -- (macro)
<br><code> </code>substitute for a ``free variable''
</b><br><br>
<b><a href="ACL2-PC_colon__colon_QUIET.html">ACL2-PC::QUIET</a> -- (meta)
<br><code> </code>run instructions without output
</b><br><br>
<b><a href="ACL2-PC_colon__colon_R.html">ACL2-PC::R</a> -- (macro)
<br><code> </code>same as rewrite
</b><br><br>
<b><a href="ACL2-PC_colon__colon_REDUCE.html">ACL2-PC::REDUCE</a> -- (atomic macro)
<br><code> </code>call the ACL2 theorem prover's simplifier
</b><br><br>
<b><a href="ACL2-PC_colon__colon_REDUCE-BY-INDUCTION.html">ACL2-PC::REDUCE-BY-INDUCTION</a> -- (macro)
<br><code> </code>call the ACL2 prover without induction, after going into
<br><code> </code>induction
</b><br><br>
<b><a href="ACL2-PC_colon__colon_REMOVE-ABBREVIATIONS.html">ACL2-PC::REMOVE-ABBREVIATIONS</a> -- (primitive)
<br><code> </code>remove one or more abbreviations
</b><br><br>
<b><a href="ACL2-PC_colon__colon_REPEAT.html">ACL2-PC::REPEAT</a> -- (macro)
<br><code> </code>repeat the given instruction until it ``fails''
</b><br><br>
<b><a href="ACL2-PC_colon__colon_REPEAT-REC.html">ACL2-PC::REPEAT-REC</a> -- (macro)
<br><code> </code>auxiliary to <code>repeat</code>
</b><br><br>
<b><a href="ACL2-PC_colon__colon_REPLAY.html">ACL2-PC::REPLAY</a> -- (macro)
<br><code> </code>replay one or more instructions
</b><br><br>
<b><a href="ACL2-PC_colon__colon_RESTORE.html">ACL2-PC::RESTORE</a> -- (meta)
<br><code> </code>remove the effect of an UNDO command
</b><br><br>
<b><a href="ACL2-PC_colon__colon_RETAIN.html">ACL2-PC::RETAIN</a> -- (atomic macro)
<br><code> </code>drop all <strong>but</strong> the indicated top-level hypotheses
</b><br><br>
<b><a href="ACL2-PC_colon__colon_RETRIEVE.html">ACL2-PC::RETRIEVE</a> -- (macro)
<br><code> </code>re-enter the proof-checker
</b><br><br>
<b><a href="ACL2-PC_colon__colon_REWRITE.html">ACL2-PC::REWRITE</a> -- (primitive)
<br><code> </code>apply a rewrite rule
</b><br><br>
<b><a href="ACL2-PC_colon__colon_RUN-INSTR-ON-GOAL.html">ACL2-PC::RUN-INSTR-ON-GOAL</a> -- (macro)
<br><code> </code>auxiliary to THEN
</b><br><br>
<b><a href="ACL2-PC_colon__colon_RUN-INSTR-ON-NEW-GOALS.html">ACL2-PC::RUN-INSTR-ON-NEW-GOALS</a> -- (macro)
<br><code> </code>auxiliary to <code>then</code>
</b><br><br>
<b><a href="ACL2-PC_colon__colon_RUNES.html">ACL2-PC::RUNES</a> -- (macro)
<br><code> </code>print the runes (definitions, lemmas, ...) used
</b><br><br>
<b><a href="ACL2-PC_colon__colon_S.html">ACL2-PC::S</a> -- (primitive)
<br><code> </code>simplify the current subterm
</b><br><br>
<b><a href="ACL2-PC_colon__colon_S-PROP.html">ACL2-PC::S-PROP</a> -- (atomic macro)
<br><code> </code>simplify propositionally
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SAVE.html">ACL2-PC::SAVE</a> -- (macro)
<br><code> </code>save the proof-checker state (state-stack)
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SEQUENCE.html">ACL2-PC::SEQUENCE</a> -- (meta)
<br><code> </code>run the given list of instructions according to a multitude of
<br><code> </code>options
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SHOW-ABBREVIATIONS.html">ACL2-PC::SHOW-ABBREVIATIONS</a> -- (macro)
<br><code> </code>display the current abbreviations
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SHOW-REWRITES.html">ACL2-PC::SHOW-REWRITES</a> -- (macro)
<br><code> </code>display the applicable rewrite rules
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SKIP.html">ACL2-PC::SKIP</a> -- (macro)
<br><code> </code>``succeed'' without doing anything
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SL.html">ACL2-PC::SL</a> -- (atomic macro)
<br><code> </code>simplify with lemmas
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SPLIT.html">ACL2-PC::SPLIT</a> -- (atomic macro)
<br><code> </code>split the current goal into cases
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SR.html">ACL2-PC::SR</a> -- (macro)
<br><code> </code>same as SHOW-REWRITES
</b><br><br>
<b><a href="ACL2-PC_colon__colon_SUCCEED.html">ACL2-PC::SUCCEED</a> -- (macro)
<br><code> </code>run the given instructions, and ``succeed''
</b><br><br>
<b><a href="ACL2-PC_colon__colon_TH.html">ACL2-PC::TH</a> -- (macro)
<br><code> </code>print the top-level hypotheses and the current subterm
</b><br><br>
<b><a href="ACL2-PC_colon__colon_THEN.html">ACL2-PC::THEN</a> -- (macro)
<br><code> </code>apply one instruction to current goal and another to new subgoals
</b><br><br>
<b><a href="ACL2-PC_colon__colon_TOP.html">ACL2-PC::TOP</a> -- (atomic macro)
<br><code> </code>move to the top of the goal
</b><br><br>
<b><a href="ACL2-PC_colon__colon_TYPE-ALIST.html">ACL2-PC::TYPE-ALIST</a> -- (macro)
<br><code> </code>display the type-alist from the current context
</b><br><br>
<b><a href="ACL2-PC_colon__colon_UNDO.html">ACL2-PC::UNDO</a> -- (meta)
<br><code> </code>undo some instructions
</b><br><br>
<b><a href="ACL2-PC_colon__colon_UNSAVE.html">ACL2-PC::UNSAVE</a> -- (macro)
<br><code> </code>remove a proof-checker state
</b><br><br>
<b><a href="ACL2-PC_colon__colon_UP.html">ACL2-PC::UP</a> -- (primitive)
<br><code> </code>move to the parent (or some ancestor) of the current subterm
</b><br><br>
<b><a href="ACL2-PC_colon__colon_USE.html">ACL2-PC::USE</a> -- (atomic macro)
<br><code> </code>use a lemma instance
</b><br><br>
<b><a href="ACL2-PC_colon__colon_WRAP.html">ACL2-PC::WRAP</a> -- (atomic macro)
<br><code> </code>execute the indicated instructions and combine all the new goals
</b><br><br>
<b><a href="ACL2-PC_colon__colon_WRAP-INDUCT.html">ACL2-PC::WRAP-INDUCT</a> -- (atomic macro)
<br><code> </code>same as induct, but create a single goal
</b><br><br>
<b><a href="ACL2-PC_colon__colon_WRAP1.html">ACL2-PC::WRAP1</a> -- (primitive)
<br><code> </code>combine goals into a single goal
</b><br><br>
<b><a href="ACL2-PC_colon__colon_X.html">ACL2-PC::X</a> -- (atomic macro)
<br><code> </code>expand and (maybe) simplify function call at the current subterm
</b><br><br>
<b><a href="ACL2-PC_colon__colon_X-DUMB.html">ACL2-PC::X-DUMB</a> -- (atomic macro)
<br><code> </code>expand function call at the current subterm, without simplifying
</b><br><br>
<br><br><br><a href="acl2-doc.html"><img src="llogo.gif"></a>
</body>
</html>
|
